Negation as failure using tight derivations for general logic programs

DOI10.1016/0743-1066(89)90032-0zbMath0668.68108MaRDI 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 program; Herbrand base; negation-as-failure rule; bounded-term-size; freedom from recursive negation; iterated-fixed-point semantics; tight derivations; tight tree semantics

Mathematics Subject Classification ID

68Q60: Specification and verification (program logics, model checking, etc.)

03B35: Mechanization of proofs and logical operations

Related Items

The intricacies of three-valued extensional semantics for higher-order 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, Semantic-based construction of arguments: an answer set programming approach, Three-valued nonmonotonic formalisms and semantics of logic programs, The expressive powers of stable models for bound and unbound DATALOG queries, Modality and interrupts, Static semantics for normal and disjunctive logic programs, Well-founded and stationary models of logic programs, Backdoors to tractable answer set programming