scientific article; zbMATH DE number 4160107
From MaRDI portal
Recommendations
- Three-valued nonmonotonic formalisms and semantics of logic programs
- scientific article; zbMATH DE number 25192
- On the relations between stable and well-founded semantics of logic programs
- The well-founded semantics for general logic programs
- A simple fixed point characterization of three-valued stable model semantics
Cited in
(60)- Complexity and expressive power of deterministic semantics for DATALOG^ .
- Default consequence relations as a logical framework for logic programs
- Uniform semantic treatment of default and autoepistemic logics
- Three-valued semantic pluralism: a defense of a three-valued solution to the \textit{sorites} paradox
- Modal provability foundations for argumentation networks
- Three-valued nonmonotonic formalisms and semantics of logic programs
- Two simple characterizations of well-founded semantics
- The expressive power of ``possible-is-certain semantics (extended abstract)
- On the relations between stable and well-founded semantics of logic programs
- Stable and extension class theory for logic programs and default logics
- On the equivalence between logic programming semantics and argumentation semantics
- Non-deterministic approximation fixpoint theory and its application in disjunctive logic programming
- Complete extensions in argumentation coincide with 3-valued stable models in logic programming
- Enhancing global SLS-resolution with loop cutting and tabling mechanisms
- Logic Programming, Argumentation and Human Reasoning
- SOS rule formats for zero and unit elements
- On the equivalence between abstract dialectical frameworks and logic programs
- SOS formats and meta-theory: 20 years after
- Abduction in argumentation frameworks
- On the equivalence of the static and disjunctive well-founded semantics and its computation
- Functional queries in datalog
- A conservative look at operational semantics with variable binding
- A nondeterministic well-founded semantics
- The expressive powers of stable models for bound and unbound DATALOG queries
- Approximation Fixpoint Theory and the Semantics of Logic and Answers Set Programs
- On the extension of logic programming with negation through uniform proofs
- Variable binding operators in transition system specifications
- Integrating Inductive Definitions in SAT
- Semantics and expressiveness of ordered SOS
- On the strong completion of logic programs
- An abstract argumentation and logic programming comparison based on 5-valued labellings
- Assumption-based argumentation is logic programming with projection
- Rule formats for distributivity
- A claim-centric perspective on abstract argumentation semantics: claim-defeat, principles, and expressiveness
- Rooted branching bisimulation as a congruence
- Well-founded semantics and stratification for ordered logic programs
- What is failure? An approach to constructive negation
- Well-founded and stationary models of logic programs
- scientific article; zbMATH DE number 4147552 (Why is no real title available?)
- Three-valued semantics for hybrid MKNF knowledge bases revisited
- Syntax and semantics of multi-adjoint normal logic programming
- Multi-valued stable semantics for logic programs
- A simple fixed point characterization of three-valued stable model semantics
- A paraconsistent logic programming approach for querying inconsistent databases
- Logic programming semantics made easy
- On three-valued acceptance conditions of abstract dialectical frameworks
- Loop checking and the well-founded semantics
- Ultimate approximation and its application in nonmonotonic knowledge representation systems
- Topological investigations of the operators of the well-founded, and alternating fixed-point semantics of normal logic programs
- A unified rule format for bounded nondeterminism in SOS with terms as labels
- Annotated defeasible logic
- Strong and explicit negation in non-monotonic reasoning and logic programming
- Parametrized semantics of logic programs -- a unifying framework
- Equivalence of well-founded and stable semantics
- A congruence rule format with universal quantification
- The meaning of negative premises in transition system specifications. II
- Fixpoint semantics for logic programming a survey
- Modeling the suppression task under weak completion and well-founded semantics
- A sound and complete procedure for a general logic program in non-floundering derivations with respect to the 3-valued stable model semantics
- Skeptical reason maintenance and belief revision
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3486858)
