Sciweavers

82 search results - page 1 / 17
» CR-Prolog with Ordered Disjunction
Sort
View
FUIN
2006
145views more  FUIN 2006»
13 years 7 months ago
Negative Ordered Hyper-Resolution as a Proof Procedure for Disjunctive Logic Programming
We prove that negative hyper-resolution using any liftable and well-founded ordering refinement is a sound and complete procedure for answering queries in disjunctive logic program...
Linh Anh Nguyen
CORR
2002
Springer
131views Education» more  CORR 2002»
13 years 7 months ago
Logic Programming with Ordered Disjunction
Abstract. Logic Programming paradigms that allow for expressing preferences have drawn a lot of research interest over the last years. Among them, the principle of ordered disjunct...
Gerhard Brewka
ASP
2003
Springer
14 years 19 days ago
CR-Prolog with Ordered Disjunction
We present CR-Prolog2, an extension of A-Prolog with cr-rules and ordered disjunction. CR-rules can be used to formalize various types of common-sense knowledge and reasoning, tha...
Marcello Balduccini, Veena S. Mellarkod
ICLP
2003
Springer
14 years 18 days ago
Order and Negation as Failure
We equip ordered logic programs with negation as failure, using a simple generalization of the preferred answer set semantics for ordered programs. This extension supports a conven...
Davy Van Nieuwenborgh, Dirk Vermeir
AAAI
2000
13 years 8 months ago
Disjunctive Temporal Reasoning in Partially Ordered Models of Time
Certain problems in connection with, for example, cooperating agents and distributed systems require reasoning about time which is measured on incomparable or unsynchronized time ...
Mathias Broxvall, Peter Jonsson