Logic programming and negation: A survey
From MaRDI portal
Cited in
(56)- A note on the stable model semantics for logic programs
- A semantics for modular general logic programs
- Expressive power and complexity of partial models for disjunctive deductive databases
- What is failure? An approach to constructive negation
- Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation
- A unifying view for logic programming with non-monotonic reasoning
- Encoding transition systems in sequent calculus
- Logic programming and knowledge representation---The A-Prolog perspective
- The meaning of negative premises in transition system specifications. II
- A logic programming system for nonmonotonic reasoning
- Disjunctive logic programs, answer sets, and the cut rule
- Recursive rules with aggregation: a simple unified semantics
- A fixed point theorem for non-monotonic functions
- Multi-context systems in dynamic environments
- An extended constraint deductive database: theory and implementation
- Dialectic proof procedures for assumption-based, admissible argumentation
- An infinite-game semantics for well-founded negation in logic programming
- Mapping deontic operators to abductive expectations
- Temporal stratification tests for linear and branching-time deductive databases
- The refinement extension principle for semantics of dynamic logic programming
- Synthesis of positive logic programs for checking a class of definitions with infinite quantification
- A new approach to hybrid probabilistic logic programs
- Failure and equality in functional logic programming
- A necessary condition for constructive negation in constraint logic programming
- Program specialization for verifying infinite state systems: an experimental evaluation
- Accepting/rejecting propositions from accepted/rejected propositions: A unifying overview
- Transformations of logic programs on infinite lists
- Justifications for logic programs under answer set semantics
- Answer Set Programming: A Primer
- Foundations of the rule-based system \(\rho\,\text{Log}\)
- RASP and ASP as a fragment of linear logic
- Generating explanations for biomedical queries
- Putting logic-based distributed systems on stable grounds
- Query answering in resource-based answer set semantics
- αCheck: A mechanized metatheory model checker
- Adding Metalogic Features to Knowledge Representation Languages*
- Characterizing D-WFS: confluence and iterated GCWA
- Generalization strategies for the verification of infinite state systems
- Integration of Abductive Reasoning and Constraint Optimization in SCIFF
- Formalizing a Constraint Deductive Database Language Based on Hereditary Harrop Formulas with Negation
- Variable binding operators in transition system specifications
- Stratified negation in temporal logic programming and the cycle-sum test
- Constructive negation and constraint logic programming with sets
- On Signings and the Well-Founded Semantics
- A Survey of the Proof-Theoretic Foundations of Logic Programming
- Analysis and Transformation of Constrained Horn Clauses for Program Verification
- On correctness of normal logic programs
- Proof-theoretic foundations of normal logic programs
- Soundness and completeness versus lifting property
- Prolegomena to logic programming for non-monotonic reasoning
- Defeasible reasoning via \(\mathrm{Datalog} {}^\neg\)
- Proof theory of Nelson's paraconsistent logic: a uniform perspective
- Enhancing disjunctive logic programming systems by SAT checkers
- What truth depends on
- Nonmonotonic abductive inductive learning
- Well-founded semantics for Boolean grammars
This page was built for publication: Logic programming and negation: A survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4305624)
