Non-Monotonic Extensions of Logic Programming: ICLP '94 Workshop, Santa Margherita Ligure, Italy, June 17, 1994. Selected Papers
Springer Science & Business Media, Jun 20, 1995 - Computers - 229 pages
This volume is based on papers presented during the ICLP '94 Workshop on Nonmonotonic Extensions of Logic Programming and on papers solicited afterwards from key researchers participating in the workshop. In total 10 carefully refereed, revised, full research papers on semantics and computational aspects of logic programs are included.
Logic programs rely on a nonmonotonic operator often referred to as negation by failure or negation by default. The nonmonoticity of this operator allows to apply results from the area of nonmonotonic theories to the investigation of logic programs (and vice versa). This volume is devoted to the interdependence of nonmonotonic formalisms and logic programming.
What people are saying - Write a review
We haven't found any reviews in the usual places.
An argumentation theoretic semantics based on nonrefutable falsity
From Disjunctive Programs to Abduction
Semantics of Normal and Disjunctive Logic Programs A Unifying Framework
Every Normal Program has a NearlyStable Model
Logic Programming with Assumption Denial
A Resolutionbased Procedure for Default Theories with Extensions
A General Approach to BottomUp Computation of Disjunctive Semantics
Static Semantics as Program Transformation and WellFounded Computation
Magic Computation for Wellfounded Semantics
Computing Stable and Partial Stable Models of Extended Disjunctive Logic Programs
Other editions - View all
3-valued A-model adding algorithm allows answer set apply approach assume assumption atoms autoepistemic axiom belief theory bottom-up called classical clauses closed comp complete computation conditional facts consequence consider consistent constraints construction contains contradiction correspondence databases deductive default theory defined Definition denoted derived disjunctive logic programs disjunctive programs editors edlp equivalent evaluation Example exists extension fact false final fixed fixpoint forest formula framework given ground head Hence holds inExtension refutation instance interpretation introduced knowledge language least Lemma literals logic programs magic maximal meaning minimal model model semantics negation negative node normal programs Note obtained operator partial positive possible Proc procedure Proceedings Proof properties proposed Proposition query reasoning respect result rule satisfies semantics stable model step subset supported Suppose sustainable Theorem transformation translation true unknown well-founded