Logic programming and negation: A survey
From MaRDI portal
Publication:4305624
DOI10.1016/0743-1066(94)90024-8zbMath0942.68518OpenAlexW2097366413MaRDI QIDQ4305624
Krzysztof R. Apt, Roland N. Bol
Publication date: 13 October 1994
Published in: The Journal of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://research.tue.nl/nl/publications/logic-programming-and-negation--a-survey(bad20583-a04c-4095-8f58-68c9b61bce56).html
Related Items
The meaning of negative premises in transition system specifications. II, Nonmonotonic abductive inductive learning, A necessary condition for constructive negation in constraint logic programming, Synthesis of positive logic programs for checking a class of definitions with infinite quantification, Well-founded semantics for Boolean grammars, A logic programming system for nonmonotonic reasoning, What is failure? An approach to constructive negation, Generalization strategies for the verification of infinite state systems, Recursive rules with aggregation: a simple unified semantics, A new approach to hybrid probabilistic logic programs, Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation, Integration of Abductive Reasoning and Constraint Optimization in SCIFF, A note on the stable model semantics for logic programs, RASP and ASP as a fragment of linear logic, A unifying view for logic programming with non-monotonic reasoning, 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, 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, Encoding transition systems in sequent calculus, On correctness of normal logic programs, Proof-theoretic foundations of normal logic programs, An extended constraint deductive database: theory and implementation, Accepting/rejecting propositions from accepted/rejected propositions: A unifying overview, Dialectic proof procedures for assumption-based, admissible argumentation, Program Specialization for Verifying Infinite State Systems: An Experimental Evaluation, Adding Metalogic Features to Knowledge Representation Languages*, An infinite-game semantics for well-founded negation in logic programming, Unnamed Item, Variable binding operators in transition system specifications, A fixed point theorem for non-monotonic functions, Transformations of logic programs on infinite lists, Stratified negation in temporal logic programming and the cycle-sum test, Constructive negation and constraint logic programming with sets, Mapping deontic operators to abductive expectations, Justifications for logic programs under answer set semantics, Formalizing a Constraint Deductive Database Language Based on Hereditary Harrop Formulas with Negation, Answer Set Programming: A Primer, A semantics for modular general logic programs, Expressive power and complexity of partial models for disjunctive deductive databases, Proof theory of Nelson's paraconsistent logic: a uniform perspective, Foundations of the rule-based system ρLog, Multi-context systems in dynamic environments, Characterizing D-WFS: Confluence and iterated GCWA, Temporal stratification tests for linear and branching-time deductive databases, Disjunctive logic programs, answer sets, and the cut rule, The refinement extension principle for semantics of dynamic logic programming, Logic programming and knowledge representation---The A-Prolog perspective, Enhancing disjunctive logic programming systems by SAT checkers, What truth depends on
