The well-founded semantics for general logic programs

DOI10.1145/116825.116838zbMath0799.68045OpenAlexW1968513265MaRDI QIDQ4302849

Kenneth A. Ross, John S. Schlipf, Allen van Gelder

Publication date: 13 November 1994

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/116825.116838

zbMATH Keywords

well-founded semanticslogic programsHerbrand modelstable modelselementary relationsprogram completion3-valued interpretations

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Logic programming (68N17)

Related Items (only showing first 100 items - show all)

Correctness and Completeness of Logic Programs ⋮ On Well-Founded Set-Inductions and Locally Monotone Operators ⋮ Default Negation as Explicit Negation plus Update ⋮ Collaborative vs. Conflicting Learning, Evolution and Argumentation ⋮ Update rules in datalog programs ⋮ Debugging for Model Expansion ⋮ Logic Programming with Defaults and Argumentation Theories ⋮ Logic Programs under Three-Valued Łukasiewicz Semantics ⋮ Belief, provability, and logic programs ⋮ On the strong completion of logic programs ⋮ An algebraic construction of the well-founded model ⋮ A paraconsistent relational data model ⋮ About boundedness for some datalog and DATALOGneg programs ⋮ Passive and active rules in deductive databases ⋮ Logic Programming, Argumentation and Human Reasoning ⋮ Complexity results for abductive logic programming ⋮ Abduction over 3-valued extended logic programs ⋮ Computing the well-founded semantics faster ⋮ On the extension of logic programming with negation through uniform proofs ⋮ Default consequence relations as a logical framework for logic programs ⋮ Nonmonotonic inheritance, argumentation and logic programming ⋮ An abductive framework for extended logic programming ⋮ Stable classes and operator pairs for disjunctive programs ⋮ FOLASP: FO(·) as Input Language for Answer Set Solvers ⋮ On Signings and the Well-Founded Semantics ⋮ Fifty Years of Prolog and Beyond ⋮ A Survey of the Proof-Theoretic Foundations of Logic Programming ⋮ Parallel Logic Programming: A Sequel ⋮ Query answering in resource-based answer set semantics ⋮ Constraint answer set solver EZCSP and why integration schemas matter ⋮ Enhancing Magic Sets with an Application to Ontological Reasoning ⋮ Founded (Auto)Epistemic Equilibrium Logic Satisfies Epistemic Splitting ⋮ Paracoherent Answer Set Semantics meets Argumentation Frameworks ⋮ Better Paracoherent Answer Sets with Less Resources ⋮ About Epistemic Negation and World Views in Epistemic Logic Programs ⋮ Incremental Answer Set Programming with Overgrounding ⋮ On combining ontologies and rules ⋮ Answer set programming made easy ⋮ Layerings of logic programs -- layer decomposable semantics and incremental model computation ⋮ Modularization of logic programs ⋮ Proof-theoretic foundations of normal logic programs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Exploiting Game Theory for Analysing Justifications ⋮ Approximating agreements in formal argumentation dialogues1 ⋮ Preference queries in deductive databases ⋮ Variable binding operators in transition system specifications ⋮ Cumulativity Tailored for Nonmonotonic Reasoning ⋮ On the Coincidence of Semantics for Uniquely Determined Programs ⋮ A general theory of confluent rewriting systems for logic programming and its applications ⋮ The limits of fixed-order computation ⋮ On the equivalence of the static and disjunctive well-founded semantics and its computation ⋮ Abduction in argumentation frameworks ⋮ Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets ⋮ Answering the “why” in answer set programming – A survey of explanation approaches ⋮ A sound and complete procedure for a general logic program in non-floundering derivations with respect to the 3-valued stable model semantics ⋮ Logic programming semantics made easy ⋮ plasp 3: Towards Effective ASP Planning ⋮ Rethinking Defeasible Reasoning: A Scalable Approach ⋮ Omission-Based Abstraction for Answer Set Programs ⋮ Programming with Annotated Logics ⋮ Abstraction for non-ground answer set programs ⋮ Strong and explicit negation in non-monotonic reasoning and logic programming ⋮ Characterizing D-WFS: Confluence and iterated GCWA ⋮ Twelve Definitions of a Stable Model ⋮ Concurrent and Local Evaluation of Normal Programs ⋮ Lparse Programs Revisited: Semantics and Representation of Aggregates ⋮ Compiling Fuzzy Answer Set Programs to Fuzzy Propositional Theories ⋮ Abstract Answer Set Solvers ⋮ Approximation Schemes in Logic and Artificial Intelligence ⋮ Reactive computing as model generation ⋮ Logic program semantics and circumscription of autoepistemic theories ⋮ Belief revision via Lamarckian evolution ⋮ Evolution of rule-based programs ⋮ The meaning of negative premises in transition system specifications. II ⋮ Routley star and hyperintensionality ⋮ On abstract modular inference systems and solvers ⋮ Logic programs and connectionist networks ⋮ Parametrized semantics of logic programs -- a unifying framework ⋮ Well-founded semantics for Boolean grammars ⋮ Autoepistemic logic programming ⋮ Autoepistemic logic of first order and its expressive power ⋮ What is failure? An approach to constructive negation ⋮ The distribution semantics for normal programs with function symbols ⋮ SLDNF resolution with non-safe rule and fixpoint semantics for general logic programs ⋮ Formalizing a logic for logic programming ⋮ Safe inductions and their applications in knowledge representation ⋮ A generalization of the Lin-Zhao theorem ⋮ The expressive powers of stable models for bound and unbound DATALOG queries ⋮ Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation ⋮ Reasoning under minimal upper bounds in propositional logic ⋮ Game semantics for non-monotonic intensional logic programming ⋮ Disjunctive logic and semantics of disjunctive logic programs ⋮ A framework for modular ERDF ontologies ⋮ Ultimate approximation and its application in nonmonotonic knowledge representation systems ⋮ On the complexity of entailment in propositional multivalued logics ⋮ Polynomial-time computable stable models

This page was built for publication: The well-founded semantics for general logic programs