Negation in logic programming
From MaRDI portal
Recommendations
Cited in
(80)- A rewrite mechanism for logic programs with negation
- A note on the stable model semantics for logic programs
- Between constructive mathematics and PROLOG
- Three-valued nonmonotonic formalisms and semantics of logic programs
- A simple fixed point characterization of three-valued stable model semantics
- Complete extension of general logic programs
- A completeness result for allowed semi-strict programs with respect to well-behaved and allowed query clauses
- A slight strengthening of a theorem of Blair and Kunen
- Transforming normal logic programs to constraint logic programs
- Equivalence-preserving first-order unfold/fold transformation systems
- A semantics for modular general logic programs
- Logic programs, well-orderings, and forward chaining
- The role of standardising apart in logic programming
- A kind of logical compilation for knowledge bases
- A three-valued semantics for deductive databases and logic programs
- The liberalized -rule in free variable semantic tableaux
- Autoepistemic logic programming
- What is failure? An approach to constructive negation
- SLDNF resolution with non-safe rule and fixpoint semantics for general logic programs
- Formalizing a logic for logic programming
- Definite clause programs are canonical (over a suitable domain)
- A logical semantics for depth-first Prolog with ground negation
- Logic programming and knowledge representation---The A-Prolog perspective
- Fixpoint semantics for logic programming a survey
- Quantifier elimination for infinite terms
- A sound and complete semantics for a version of negation as failure
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games
- Negation and constraint logic programming
- A logic programming system for nonmonotonic reasoning
- First-order theories for pure Prolog programs with negation
- On inductive inference of cyclic structures
- Well-founded and stationary models of logic programs
- Complexity and undecidability results for logic programming
- An extended constraint deductive database: theory and implementation
- Mapping deontic operators to abductive expectations
- Nonmonotonic trust management for P2P applications
- Interdefinability of defeasible logic and logic programming under the well-founded semantics
- Truth versus information in logic programming
- scientific article; zbMATH DE number 4180779 (Why is no real title available?)
- The CIFF proof procedure for abductive logic programming with constraints: Theory, implementation and experiments
- scientific article; zbMATH DE number 3958694 (Why is no real title available?)
- Intuitionistic three-valued logic and logic programming
- Négation constructive et axiomatique interne
- Semantics of structured normal logic programs
- Annotated defeasible logic
- Decidability of the Clark's completion semantics for monadic programs and queries
- An improved lower bound for the elementary theories of trees
- Extending constructive logic negation with types
- Dischargeable obligations in the \(\mathcal{S}\)CIFF framework
- Nonground abductive logic programming with probabilistic integrity constraints
- A rewrite mechanism for logic programs with negation
- An equivalence preserving first order unfold/fold transformation system
- A transformation of propositional Prolog programs into classical logic
- Correctness and completeness of logic programs
- Decomposable theories
- Conceptual Structures at Work
- Integration of Abductive Reasoning and Constraint Optimization in SCIFF
- Negation-Limited Formulas.
- Approximation Schemes in Logic and Artificial Intelligence
- scientific article; zbMATH DE number 4185011 (Why is no real title available?)
- Constructive negation and constraint logic programming with sets
- Ultimate approximation and its application in nonmonotonic knowledge representation systems
- A formalised theorem in the partition calculus
- On correctness of normal logic programs
- On the bounded theories of finite trees
- Prolegomena to logic programming for non-monotonic reasoning
- Three-valued completion for abductive logic programs
- Combining explicit negation and negation by failure via Belnap's logic
- On the autoepistemic reconstruction of logic programming
- The alternating fixpoint of logic programs with negation
- A class of programs for which SLDNF resolution and NAF rule are complete
- Defeasible reasoning via \(\mathrm{Datalog} {}^\neg\)
- Model completeness for rational trees
- Strict completion of logic programs
- Data types over multiple-valued logics
- Programming in three-valued logic
- Negation in rule-based database languages: A survey
- Is there an axiomatic semantics for standard pure Prolog?
- Implementing constructive intensional negation
- Semantic-based construction of arguments: an answer set programming approach
This page was built for publication: Negation in logic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3802588)
