Negation as failure using tight derivations for general logic programs

DOI10.1016/0743-1066(89)90032-0zbMath0668.68108OpenAlexW2157221482MaRDI QIDQ3821633

Allen van Gelder

Publication date: 1989

Published in: The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0743-1066(89)90032-0

zbMATH Keywords

general logic programHerbrand basenegation-as-failure rulebounded-term-sizefreedom from recursive negationiterated-fixed-point semanticstight derivationstight tree semantics

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Mechanization of proofs and logical operations (03B35)

Related Items

Modality and interrupts, The expressive powers of stable models for bound and unbound DATALOG queries, Static semantics for normal and disjunctive logic programs, Well-founded and stationary models of logic programs, Two simple characterizations of well-founded semantics, The intricacies of three-valued extensional semantics for higher-order logic programs, Enhancing Magic Sets with an Application to Ontological Reasoning, Semantic-based construction of arguments: an answer set programming approach, Three-valued nonmonotonic formalisms and semantics of logic programs, The alternating fixpoint of logic programs with negation, Execution of logic programs by iterative-deepening A\(^*\) SLD-tree search, Enhancing global SLS-resolution with loop cutting and tabling mechanisms, Backdoors to tractable answer set programming