A kripke-kleene semantics for logic programs*
From MaRDI portal
Publication:3718131
DOI10.1016/S0743-1066(85)80005-4zbMath0589.68011MaRDI QIDQ3718131
Publication date: 1985
Published in: The Journal of Logic Programming (Search for Journal in Brave)
fixed pointsemanticsthree-valued logiclogic programmingmonotone transformationHorn clause logic programs
Specification and verification (program logics, model checking, etc.) (68Q60) Artificial intelligence (68T99) General topics in the theory of software (68N01)
Related Items (only showing first 100 items - show all)
On Well-Founded Set-Inductions and Locally Monotone Operators ⋮ Integration of Abductive Reasoning and Constraint Optimization in SCIFF ⋮ Logic Programs under Three-Valued Łukasiewicz Semantics ⋮ A transformation of propositional Prolog programs into classical logic ⋮ On Signings and the Well-Founded Semantics ⋮ On correctness of normal logic programs ⋮ Minimal intervention strategies in logical signaling networks with ASP ⋮ Variable binding operators in transition system specifications ⋮ Stability, Supportedness, Minimality and Kleene Answer Set Programs ⋮ A general theory of confluent rewriting systems for logic programming and its applications ⋮ Approximation Schemes in Logic and Artificial Intelligence ⋮ A kind of logical compilation for knowledge bases ⋮ Analyzing Semantics of Aggregate Answer Set Programming Using Approximation Fixpoint Theory ⋮ A three-valued semantics for deductive databases and logic programs ⋮ Logic programs and connectionist networks ⋮ Parametrized semantics of logic programs -- a unifying framework ⋮ Approximation Fixpoint Theory and the Semantics of Logic and Answers Set Programs ⋮ Implementing constructive intensional negation ⋮ Logical foundations and complexity of 4QL, a query language with unrestricted negation ⋮ Autoepistemic logic programming ⋮ Partial models and logic programming ⋮ First-order theories for pure Prolog programs with negation ⋮ What is failure? An approach to constructive negation ⋮ Extending Co-logic Programs for Branching-Time Model Checking ⋮ Negation with logical variables in conditional rewriting ⋮ SLDNF resolution with non-safe rule and fixpoint semantics for general logic programs ⋮ Formalizing a logic for logic programming ⋮ Probabilistic abductive logic programming using Dirichlet priors ⋮ Recursive rules with aggregation: a simple unified semantics ⋮ Uniform proofs as a foundation for logic programming ⋮ Intuitionistic three-valued logic and logic programming ⋮ Strong and uniform equivalence of nonmonotonic theories -- an algebraic approach ⋮ Basic paradigms of programming ⋮ A theory of truth that prefers falsehood ⋮ On the relationship between circumscription and negation as failure ⋮ Truth versus information in logic programming ⋮ Ultimate approximation and its application in nonmonotonic knowledge representation systems ⋮ Bilattices and the theory of truth ⋮ On the complexity of entailment in propositional multivalued logics ⋮ A rewrite mechanism for logic programs with negation ⋮ Well-founded and stationary models of logic programs ⋮ Complexity and undecidability results for logic programming ⋮ A modal theorem-preserving translation of a class of three-valued logics of incomplete information ⋮ Foreword: Three-valued logics and their applications ⋮ Modeling the suppression task under weak completion and well-founded semantics ⋮ Fixpoint techniques for non-monotone maps ⋮ On the strong completion of logic programs ⋮ An algebraic construction of the well-founded model ⋮ A paraconsistent relational data model ⋮ A logical semantics for depth-first Prolog with ground negation ⋮ Logic Programming, Argumentation and Human Reasoning ⋮ Permission to speak: a logic for access control and conformance ⋮ An operator for composing deductive data bases with theories of constraints ⋮ Computing the well-founded semantics faster ⋮ Default consequence relations as a logical framework for logic programs ⋮ Annotated defeasible logic ⋮ Logics of synonymy ⋮ Logic programming as classical inference ⋮ Semantic-based construction of arguments: an answer set programming approach ⋮ From Fuzzy to Annotated Semantic Web Languages ⋮ Reasoning about Conditions and Exceptions to Laws in Regulatory Conformance Checking ⋮ Protected completions of first-order general logic programs ⋮ A first order logic for partial functions ⋮ Fibrational Semantics for Many-Valued Logic Programs: Grounds for Non-Groundness ⋮ Sémantique logique et dénotationnelle des interpréteurs PROLOG ⋮ Generalized metrics and uniquely determined logic programs. ⋮ Borderline vs. unknown: comparing three-valued representations of imperfect information ⋮ A functorial framework for constraint normal logic programming ⋮ Three-valued nonmonotonic formalisms and semantics of logic programs ⋮ Contextual hypotheses and semantics of logic programs ⋮ A simple fixed point characterization of three-valued stable model semantics ⋮ Three-valued completion for abductive logic programs ⋮ A map of dependencies among three-valued logics ⋮ Combining explicit negation and negation by failure via Belnap's logic ⋮ Abstract interpretation: a kind of magic ⋮ Complete extension of general logic programs ⋮ A completeness result for allowed semi-strict programs with respect to well-behaved and allowed query clauses ⋮ On the autoepistemic reconstruction of logic programming ⋮ The alternating fixpoint of logic programs with negation ⋮ Constructive mathematical descriptions of subject domains ⋮ On the relations between stable and well-founded semantics of logic programs ⋮ Transforming normal logic programs to constraint logic programs ⋮ Négation constructive et axiomatique interne ⋮ Legality concepts for three-valued logic programs ⋮ A class of programs for which \(SLDNF\) resolution and \(NAF\) rule are complete ⋮ Unnamed Item ⋮ Probabilistic logic programming ⋮ On the Coincidence of Semantics for Uniquely Determined Programs ⋮ What Is in a Step: New Perspectives on a Classical Question ⋮ A rewrite mechanism for logic programs with negation ⋮ Nonmonotonic Trust Management for P2P Applications ⋮ Paraconsistent logic programming ⋮ Semantics of distributed definite clause programs ⋮ Strict completion of logic programs ⋮ Quantifier elimination for infinite terms ⋮ Data types over multiple-valued logics ⋮ Programming in three-valued logic ⋮ Negation in rule-based database languages: A survey ⋮ Initial semantics of logic specifications with negation ⋮ A semantics for modular general logic programs
This page was built for publication: A kripke-kleene semantics for logic programs*
