2014/05/14 by Yi Bi, Jia-Huai You, Bi, Yi +3
Computer Science · #FOS: Computer and information sciences #Logic, Reasoning, and Knowledge #Logic, programming, and type systems #Multi-Agent Systems and Negotiation #Programming Languages (cs.PL) #cs.PL
paper · pdf · doi:10.48550/arxiv.1405.3365
10 pages, ICLP2014
arxiv created 2014/05/14 · openalex publication_date 2014/05/14 · arxiv updated 2014/05/15 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
An FOL-program consists of a background theory in a decidable fragment of first-order logic and a collection of rules possibly containing first-order formulas. The formalism stems from recent approaches to tight integrations of ASP with description logics. In this paper, we define a well-founded semantics for FOL-programs based on a new notion of unfounded sets on consistent as well as inconsistent sets of literals, and study some of its properties. The semantics is defined for all FOL-programs, including those where it is necessary to represent inconsistencies explicitly. The semantics supports a form of combined reasoning by rules under closed world as well as open world assumptions, and it is a generalization of the standard well-founded semantics for normal logic programs. We also show that the well-founded semantics defined here approximates the well-supported answer set semantics for normal DL programs.