Negation as failure using tight derivations for general logic programs

DOI10.1016/0743-1066(89)90032-0MaRDI QIDQ3821633zbMATH OpenOpenAlexFDO

Authors 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

bounded-term-sizefreedom from recursive negationgeneral logic programHerbrand baseiterated-fixed-point semanticsnegation-as-failure ruletight derivationstight tree semantics

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4199654
• Negation-as-failure rule for general logic programs with equality
• General failure of logic programs
• Tight logic programs
• Negation as failure as resolution

Cited in

(23)

• 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
• Tight semantics for logic programs
• On termination of general logic programs w.R.T. constructive negation
• scientific article; zbMATH DE number 4199654 (Why is no real title available?)
• General failure of logic programs
• Negation-as-failure rule for general logic programs with equality
• The intricacies of three-valued extensional semantics for higher-order logic programs
• Tight logic programs
• Defeasible logic versus Logic Programming without Negation as Failure
• Two simple characterizations of well-founded semantics
• Enhancing magic sets with an application to ontological reasoning
• Description logics of minimal knowledge and negation as failure
• Prolegomena to logic programming for non-monotonic reasoning
• The alternating fixpoint of logic programs with negation
• Execution of logic programs by iterative-deepening A\(^*\) SLD-tree search
• Stratified extended multi-adjoint logic programming
• Enhancing global SLS-resolution with loop cutting and tabling mechanisms
• Semantic-based construction of arguments: an answer set programming approach

This page was built for publication: Negation as failure using tight derivations for general logic programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3821633)