The well-founded semantics for general logic programs
From MaRDI portal
Publication:4302849
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
well-founded semanticslogic programsHerbrand modelstable modelselementary relationsprogram completion3-valued interpretations
Related Items
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, XSB: Extending Prolog with Tabled Logic Programming, Answer Set Programming Modulo Acyclicity, Enablers and Inhibitors in Causal Justifications of Logic Programs, Characterising and Explaining Inconsistency in Logic Programs, Approximation Fixpoint Theory and the Semantics of Logic and Answers Set Programs, Oscillating Behavior of Logic Programs, Connecting First-Order ASP and the Logic FO(ID) through Reducts, Well-Supported Semantics for Logic Programs with Generalized Rules, A logic programming system for nonmonotonic reasoning, Modular materialisation of Datalog programs, Characterising equilibrium logic and nested logic programs: Reductions and complexity,, Recursive rules with aggregation: a simple unified semantics, A new approach to hybrid probabilistic logic programs, Combining answer set programming with description logics for the semantic web, Approximation Fixpoint Theory and the Well-Founded Semantics of Higher-Order Logic Programs, A functional account of probabilistic programming with possible worlds. Declarative pearl, Contextual Abductive Reasoning with Side-Effects, Argumentation-Based Semantics for Logic Programs with First-Order Formulae, A unified rule format for bounded nondeterminism in SOS with terms as labels, The expressive power of unique total stable model semantics, Labellings for assumption-based and abstract argumentation, Preserving Strong Equivalence while Forgetting, Modular Paracoherent Answer Sets, Static semantics for normal and disjunctive logic programs, The expressiveness of locally stratified programs, Well-founded and stationary models of logic programs, Complexity and undecidability results for logic programming, On the computational cost of disjunctive logic programming: Propositional case, A connection between the Cantor-Bendixson derivative and the well-founded semantics of finite logic programs, The infinite-valued semantics: overview, recent results and future directions, Modeling the suppression task under weak completion and well-founded semantics, Terminating Evaluation of Logic Programs with Finite Three-Valued Models, Integrating Inductive Definitions in SAT, On the impact of stratification on the complexity of nonmonotonic reasoning, Annotated defeasible logic, Well-founded operators for normal hybrid MKNF knowledge bases, The intricacies of three-valued extensional semantics for higher-order logic programs, SAT(ID): Satisfiability of Propositional Logic Extended with Inductive Definitions, Generating explanations for biomedical queries, Structure learning of probabilistic logic programs by searching the clause space, Inference and learning in probabilistic logic programs using weighted Boolean formulas, Knowledge compilation of logic programs using approximation fixpoint theory, Predicate logic as a modeling language: modeling and solving some machine learning and data mining problems withIDP3, Modular action language, Programming in logic without logic programming, Simple contrapositive assumption-based argumentation frameworks, Lifted discriminative learning of probabilistic logic programs, A three-valued semantics for querying and repairing inconsistent databases, Statistical statements in probabilistic logic programming, Interlinking logic programs and argumentation frameworks, The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference, An extended constraint deductive database: theory and implementation, A Top-Down Query Answering Procedure for Normal Logic Programs Under the Any-World Assumption, A Logical Approach to Qualitative and Quantitative Reasoning, On the limits of forgetting in answer set programming, A QBF-based formalization of abstract argumentation semantics, Dialectic proof procedures for assumption-based, admissible argumentation, Partial equilibrium logic, An introduction to fuzzy answer set programming, Rooted branching bisimulation as a congruence, atalog: A logic language for expressing search and optimization problems, A paraconsistent logic programming approach for querying inconsistent databases, Making sense of sensory input, A semantics for hybrid probabilistic logic programs with function symbols, Neural probabilistic logic programming in DeepProbLog, Paracoherent answer set computation, An infinite-game semantics for well-founded negation in logic programming, Why-provenance information for RDF, rules, and negation, Preferential theory revision, BEYOND TAMAKI-SATO STYLE UNFOLD/FOLD TRANSFORMATIONS FOR NORMAL LOGIC PROGRAMS, Unnamed Item, A fixed point theorem for non-monotonic functions, Loop formulas for description logic programs, Thirteen Definitions of a Stable Model, Justifications for logic programs under answer set semantics, Determining inference semantics for disjunctive logic programs, Nonmonotonic Trust Management for P2P Applications, Modality Argumentation Programming, Fixed point semantics for stream reasoning, Autoepistemic answer set programming, Flexible Approximators for Approximating Fixpoint Theory, Transition systems for model generators—A unifying approach, Tractable reasoning using logic programs with intensional concepts, Normative Systems Represented as Hybrid Knowledge Bases, Expressing Extension-Based Semantics Based on Stratified Minimal Models, Answer Set Programming: A Primer, Well-Founded and Partial Stable Semantics Logical Aspects, CP-logic: A language of causal probabilistic events and its relation to logic programming, Some (in)translatability results for normal logic programs and propositional theories, The CIFF proof procedure for abductive logic programming with constraints: Theory, implementation and experiments, Learning hierarchical probabilistic logic programs, Writing Declarative Specifications for Clauses, Extensional Semantics for Higher-Order Logic Programs with Negation, Abduction with probabilistic logic programming under the distribution semantics, Interdefinability of defeasible logic and logic programming under the well-founded semantics, Epistemology and artificial intelligence, Any-world assumptions in logic programming, Graph-based construction of minimal models, The refinement extension principle for semantics of dynamic logic programming, Knowledge assimilation in domains of actions: a possible causes approach, 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, Three-valued semantics for hybrid MKNF knowledge bases revisited, Argumentation in disjunctive logic programming, Causal inference in cplint, A game semantics for disjunctive logic programming, Divide and congruence. II: From decomposition of modal formulas to preservation of delay and weak bisimilarity, Abduction from logic programs: Semantics and complexity, A unifying view for logic programming with non-monotonic reasoning, On compact representations of propositional circumscription, Is intractability of nonmonotonic reasoning a real drawback?, Grounded fixpoints and their applications in knowledge representation, A new probabilistic constraint logic programming language based on a generalised distribution semantics, Fixpoint semantics for active integrity constraints, Well-founded semantics for defeasible logic, Logic programming as classical inference, Semantic-based construction of arguments: an answer set programming approach, An abstract, argumentation-theoretic approach to default reasoning, Divide and congruence: from decomposition of modal formulas to preservation of branching and \(\eta \)-bisimilarity, On updates of hybrid knowledge bases composed of ontologies and rules, An OpenCL implementation of a forward sampling algorithm for CP-logic, Conflict-free and conflict-tolerant semantics for constrained argumentation frameworks, Extended RDF: computability and complexity issues, Tightly integrated probabilistic description logic programs for representing ontology mappings, Applying the information bottleneck to statistical relational learning, A novel logic-based automatic approach to constructing compliant security policies, Semantics of structured normal logic programs, Local closed world reasoning with description logics under the well-founded semantics, Generalized metrics and uniquely determined logic programs., Relating constraint answer set programming languages and algorithms, A simple fixed point characterization of three-valued stable model semantics, Iterative belief revision in extended logic programming, Contributions to the stable model semantics of logic programs with negation, Bottom-up evaluation and query optimization of well-founded models, Answering queries from context-sensitive probabilistic knowledge bases, Tie-breaking semantics and structural totality, Monotonic aggregation in deductive databases, Locally stratified Boolean grammars, On the autoepistemic reconstruction of logic programming, Skeptical reason maintenance and belief revision, The alternating fixpoint of logic programs with negation, Execution of logic programs by iterative-deepening A\(^*\) SLD-tree search, Conflict-driven answer set solving: from theory to practice, Hypertree decompositions and tractable queries, Logic programs with abstract constraint atoms: the role of computations, Enhancing global SLS-resolution with loop cutting and tabling mechanisms, Equivalence for the \(G_3^\prime\)-stable models semantics, An encompassing framework for paraconsistent logic programs, Strong equivalence of logic programs under the infinite-valued semantics, Probabilistic description logic programs, ALLPAD: approximate learning of logic programs with annotated disjunctions, A conservative look at operational semantics with variable binding, Expressive power and complexity of partial models for disjunctive deductive databases, Soundness of abductive proof procedure with respect to constraint for non-ground abducibles, Inductive situation calculus, Set based logic programming, The loop formula based semantics of description logic programs, Approximate well-founded semantics, query answering and generalized normal logic programs over lattices, Queries and computation on the web, Computing only minimal answers in disjunctive deductive databases, Logic programs, well-orderings, and forward chaining, On the equivalence and range of applicability of graph-based representations of logic programs., Relating defeasible and normal logic programming through transformation properties., Uniform semantic treatment of default and autoepistemic logics, Complexity and expressive power of deterministic semantics for DATALOG\(^ \neg\)., On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games, Interpreting disjunctive logic programs based on a strong sense of disjunction, Adding closed world assumptions to well-founded semantics, Functional queries in datalog, Logic programming and knowledge representation---The A-Prolog perspective, Preference Logic Grammars: Fixed point semantics and application to data standardization, Extending and implementing the stable model semantics, Fixpoint semantics for logic programming a survey, Semi-equilibrium models for paracoherent answer set programs, A model of legal reasoning with cases incorporating theories and values
