The well-founded semantics for general logic programs
From MaRDI portal
Publication:4302849
Recommendations
Cited in
(only showing first 100 items - show all)- Towards a Systematic Account of Different Semantics for Logic Programs
- Computing only minimal answers in disjunctive deductive databases
- A paraconsistent logic programming approach for querying inconsistent databases
- Multi-valued semantics for logic programs
- scientific article; zbMATH DE number 1929962 (Why is no real title available?)
- Generalized well-founded semantics for logic programs
- Statistical statements in probabilistic logic programming
- Default consequence relations as a logical framework for logic programs
- On the impact of stratification on the complexity of nonmonotonic reasoning
- Correct answers to allowed programs and queries are ground
- Flexible approximators for approximating fixpoint theory
- Logic program semantics and circumscription of autoepistemic theories
- Disjunctive logic and semantics of disjunctive logic programs
- Strong and explicit negation in non-monotonic reasoning and logic programming
- On well-founded set-inductions and locally monotone operators
- Abduction over 3-valued extended logic programs
- An abductive framework for extended logic programming
- Complexity results for abductive logic programming
- On the extension of logic programming with negation through uniform proofs
- Inductive situation calculus
- Set based logic programming
- An encompassing framework for paraconsistent logic programs
- Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets
- Adding closed world assumptions to well-founded semantics
- A simple fixed point characterization of three-valued stable model semantics
- Autoepistemic logic programming
- Autoepistemic logic of first order and its expressive power
- Layer Supported Models of Logic Programs
- Equivalence for the \(G_3^\prime\)-stable models semantics
- Interpreting disjunctive logic programs based on a strong sense of disjunction
- Parametrized semantics of logic programs -- a unifying framework
- scientific article; zbMATH DE number 3980532 (Why is no real title available?)
- The expressive powers of stable models for bound and unbound DATALOG queries
- Epistemology and artificial intelligence
- Argumentation in disjunctive logic programming
- Safe inductions and their applications in knowledge representation
- Writing declarative specifications for clauses
- Polynomial-time computable stable models
- Logic programs with abstract constraint atoms: the role of computations
- Nonmonotonic inheritance, argumentation and logic programming
- Towards a systematic account of different logic programming semantics
- Preference Logic Grammars: Fixed point semantics and application to data standardization
- A Logical Approach to Qualitative and Quantitative Reasoning
- A logic programming system for nonmonotonic reasoning
- A paraconsistent relational data model
- Well-supported semantics for logic programs with generalized rules
- On well-founded models for logic programs
- Programming in logic without logic programming
- Reliable Semantics for Extended Logic Programs with Rule Prioritization
- On generalized well-founded models for logic programs
- The expressive power of unique total stable model semantics
- A unifying view for logic programming with non-monotonic reasoning
- Expressive power and complexity of partial models for disjunctive deductive databases
- Soundness of abductive proof procedure with respect to constraint for non-ground abducibles
- The intricacies of three-valued extensional semantics for higher-order logic programs
- Fixpoint semantics for active integrity constraints
- Cumulativity Tailored for Nonmonotonic Reasoning
- Graph-based construction of minimal models
- Logic Programming, Argumentation and Human Reasoning
- Default Negation as Explicit Negation plus Update
- Well-founded and stationary models of logic programs
- A connection between the Cantor-Bendixson derivative and the well-founded semantics of finite logic programs
- Computing the well-founded semantics faster
- Answer set programming modulo acyclicity
- Paracoherent answer set semantics meets argumentation frameworks
- Better paracoherent answer sets with less resources
- Modular materialisation of Datalog programs
- An algebraic construction of the well-founded model
- BEYOND TAMAKI-SATO STYLE UNFOLD/FOLD TRANSFORMATIONS FOR NORMAL LOGIC PROGRAMS
- Fixed point semantics for stream reasoning
- Generating explanations for biomedical queries
- Enhancing magic sets with an application to ontological reasoning
- Founded (auto)epistemic equilibrium logic satisfies epistemic splitting
- Well-Founded and Partial Stable Semantics Logical Aspects
- Oscillating behavior of logic programs
- Contextual abductive reasoning with side-effects
- Abduction with probabilistic logic programming under the distribution semantics
- Connecting first-order ASP and the logic FO(ID) through reducts
- Why-provenance information for RDF, rules, and negation
- A semantics for hybrid probabilistic logic programs with function symbols
- plasp 3: towards effective ASP planning
- Recursive rules with aggregation: a simple unified semantics
- scientific article; zbMATH DE number 1948998 (Why is no real title available?)
- On the equivalence and range of applicability of graph-based representations of logic programs.
- Complexity and expressive power of deterministic semantics for DATALOG\(^ \neg\).
- On Signings and the Well-Founded Semantics
- An extended constraint deductive database: theory and implementation
- scientific article; zbMATH DE number 7455706 (Why is no real title available?)
- Divide and congruence. II: From decomposition of modal formulas to preservation of delay and weak bisimilarity
- Lifted discriminative learning of probabilistic logic programs
- scientific article; zbMATH DE number 4114113 (Why is no real title available?)
- Preserving strong equivalence while forgetting
- Learning hierarchical probabilistic logic programs
- Three-valued semantics for hybrid MKNF knowledge bases revisited
- Founded semantics and constraint semantics of logic rules
- On the limits of forgetting in answer set programming
- Logic programming semantics made easy
- Characterising and explaining inconsistency in logic programs
- Paracoherent answer set computation
- Layerings of logic programs -- layer decomposable semantics and incremental model computation
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)
