The well-founded semantics for general logic programs

Cited In (only showing first 100 items - show all)

The refinement extension principle for semantics of dynamic logic programming
On the autoepistemic reconstruction of logic programming
Execution of logic programs by iterative-deepening A\(^*\) SLD-tree search
Routley star and hyperintensionality
Abduction from logic programs: Semantics and complexity
Is intractability of nonmonotonic reasoning a real drawback?
Well-Supported Semantics for Logic Programs with Generalized Rules
Normative Systems Represented as Hybrid Knowledge Bases
Logic programs with abstract constraint atoms: the role of computations
The infinite-valued semantics: overview, recent results and future directions
Answer Set Programming: A Primer
Some (in)translatability results for normal logic programs and propositional theories
Equivalence for the \(G_3^\prime\)-stable models semantics
Abduction in argumentation frameworks
The expressiveness of locally stratified programs
Enhancing global SLS-resolution with loop cutting and tabling mechanisms
Formalizing a logic for logic programming
SLDNF resolution with non-safe rule and fixpoint semantics for general logic programs
Approximate well-founded semantics, query answering and generalized normal logic programs over lattices
On the equivalence of the static and disjunctive well-founded semantics and its computation
Functional queries in datalog
Epistemology and artificial intelligence
A generalization of the Lin-Zhao theorem
A conservative look at operational semantics with variable binding
A logic programming system for nonmonotonic reasoning
On compact representations of propositional circumscription
Variable binding operators in transition system specifications
Queries and computation on the web
Reasoning under minimal upper bounds in propositional logic
Simple contrapositive assumption-based argumentation frameworks
On the strong completion of logic programs
Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets
Complexity and undecidability results for logic programming
Logic Programming with Defaults and Argumentation Theories
Logic Programs under Three-Valued Łukasiewicz Semantics
A general theory of confluent rewriting systems for logic programming and its applications
Grounded fixpoints and their applications in knowledge representation
Any-world assumptions in logic programming
Interlinking logic programs and argumentation frameworks
Inductive situation calculus
Set based logic programming
A new probabilistic constraint logic programming language based on a generalised distribution semantics
Logic programming as classical inference
Semantic-based construction of arguments: an answer set programming approach
The loop formula based semantics of description logic programs
An OpenCL implementation of a forward sampling algorithm for CP-logic
On updates of hybrid knowledge bases composed of ontologies and rules
Conflict-free and conflict-tolerant semantics for constrained argumentation frameworks
Computing only minimal answers in disjunctive deductive databases
Labellings for assumption-based and abstract argumentation
A Top-Down Query Answering Procedure for Normal Logic Programs Under the Any-World Assumption
Structure learning of probabilistic logic programs by searching the clause space
Parametrized semantics of logic programs -- a unifying framework
The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference
Belief, provability, and logic programs
A model of legal reasoning with cases incorporating theories and values
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
Tie-breaking semantics and structural totality
Skeptical reason maintenance and belief revision
Semi-equilibrium models for paracoherent answer set programs
Uniform semantic treatment of default and autoepistemic logics
Terminating Evaluation of Logic Programs with Finite Three-Valued Models
Well-founded semantics for Boolean grammars
Reactive computing as model generation
Title not available (Why is that?)
A fixed point theorem for non-monotonic functions
The alternating fixpoint of logic programs with negation
Twelve Definitions of a Stable Model
Locally stratified Boolean grammars
The limits of fixed-order computation
An infinite-game semantics for well-founded negation in logic programming
Monotonic aggregation in deductive databases
XSB: extending Prolog with tabled logic programming
Divide and congruence: from decomposition of modal formulas to preservation of branching and \(\eta \)-bisimilarity
About Epistemic Negation and World Views in Epistemic Logic Programs
A QBF-based formalization of abstract argumentation semantics
On abstract modular inference systems and solvers
Loop formulas for description logic programs
Hypertree decompositions and tractable queries
Tightly integrated probabilistic description logic programs for representing ontology mappings
CP-logic: A language of causal probabilistic events and its relation to logic programming
Probabilistic description logic programs
Nonmonotonic trust management for P2P applications
Logic programs, well-orderings, and forward chaining
Relating constraint answer set programming languages and algorithms
Approximation Fixpoint Theory and the Semantics of Logic and Answers Set Programs
An abstract, argumentation-theoretic approach to default reasoning
Relating defeasible and normal logic programming through transformation properties.
atalog: A logic language for expressing search and optimization problems
Extending and implementing the stable model semantics
Transition systems for model generators—A unifying approach
Parallel Logic Programming: A Sequel
Applying the information bottleneck to statistical relational learning
A novel logic-based automatic approach to constructing compliant security policies
On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
Semantics of structured normal logic programs
Inference and learning in probabilistic logic programs using weighted Boolean formulas
Knowledge compilation of logic programs using approximation fixpoint theory

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4302849)