scientific article
From MaRDI portal
Publication:3486858
zbMath0706.68029MaRDI QIDQ3486858
Publication date: 1990
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Other nonclassical logic (03B60) Semantics in the theory of computing (68Q55) Logic programming (68N17)
Related Items (54)
The meaning of negative premises in transition system specifications. II ⋮ Parametrized semantics of logic programs -- a unifying framework ⋮ Approximation Fixpoint Theory and the Semantics of Logic and Answers Set Programs ⋮ What is failure? An approach to constructive negation ⋮ An abstract argumentation and logic programming comparison based on 5-valued labellings ⋮ Assumption-based argumentation is logic programming with projection ⋮ The expressive powers of stable models for bound and unbound DATALOG queries ⋮ Ultimate approximation and its application in nonmonotonic knowledge representation systems ⋮ A unified rule format for bounded nondeterminism in SOS with terms as labels ⋮ SOS formats and meta-theory: 20 years after ⋮ A nondeterministic well-founded semantics ⋮ Well-founded and stationary models of logic programs ⋮ Three-valued semantics for hybrid MKNF knowledge bases revisited ⋮ Modeling the suppression task under weak completion and well-founded semantics ⋮ On the strong completion of logic programs ⋮ Two simple characterizations of well-founded semantics ⋮ Logic Programming, Argumentation and Human Reasoning ⋮ Integrating Inductive Definitions in SAT ⋮ Loop checking and the well-founded semantics ⋮ On the extension of logic programming with negation through uniform proofs ⋮ Default consequence relations as a logical framework for logic programs ⋮ A claim-centric perspective on abstract argumentation semantics: claim-defeat, principles, and expressiveness ⋮ Annotated defeasible logic ⋮ On the Equivalence Between Abstract Dialectical Frameworks and Logic Programs ⋮ Rooted branching bisimulation as a congruence ⋮ Three-valued nonmonotonic formalisms and semantics of logic programs ⋮ A simple fixed point characterization of three-valued stable model semantics ⋮ A paraconsistent logic programming approach for querying inconsistent databases ⋮ Stable and extension class theory for logic programs and default logics ⋮ Skeptical reason maintenance and belief revision ⋮ On the relations between stable and well-founded semantics of logic programs ⋮ Unnamed Item ⋮ Rule formats for distributivity ⋮ Variable binding operators in transition system specifications ⋮ SOS rule formats for zero and unit elements ⋮ Enhancing global SLS-resolution with loop cutting and tabling mechanisms ⋮ On the equivalence of the static and disjunctive well-founded semantics and its computation ⋮ Complete extensions in argumentation coincide with 3-valued stable models in logic programming ⋮ Modal provability foundations for argumentation networks ⋮ Abduction in argumentation frameworks ⋮ 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 ⋮ Syntax and semantics of multi-adjoint normal logic programming ⋮ Semantics and expressiveness of ordered SOS ⋮ A conservative look at operational semantics with variable binding ⋮ Strong and explicit negation in non-monotonic reasoning and logic programming ⋮ On three-valued acceptance conditions of abstract dialectical frameworks ⋮ Uniform semantic treatment of default and autoepistemic logics ⋮ Complexity and expressive power of deterministic semantics for DATALOG\(^ \neg\). ⋮ On the equivalence between logic programming semantics and argumentation semantics ⋮ Well-founded semantics and stratification for ordered logic programs ⋮ Functional queries in datalog ⋮ A Congruence Rule Format with Universal Quantification ⋮ Fixpoint semantics for logic programming a survey
This page was built for publication:
