Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

14

ICLP
2003
Springer

favoriteEmaildiscussreport

106views Automated Reasoning» more ICLP 2003»

Order and Negation as Failure

13 years 9 months ago

Order and Negation as Failure

Download tinf2.vub.ac.be

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 convenient formulation of certain problems, which is illustrated by means of an intuitive simulation of logic programming with ordered disjunction. The simulation also supports a broader application of “ordered disjunction”, handling problems that would be cumbersome to express using ordered disjunction logic programs. Interestingly, allowing negation as failure in ordered logic programs does not yield any extra computational power: the combination of negation as failure and order can be simulated using order (and true negation) alone.

Davy Van Nieuwenborgh, Dirk Vermeir

Real-time Traffic

ICLP 2003 | Logic Programs | Ordered Disjunction | Ordered Logic | Programming Languages |

claim paper

Related Content

» Negation as Partial Failure

» Avoiding negative depth in inverse depth bearingonly SLAM

» Compiling Intensional Sets in CLP

» Creating Incentives to Prevent Intentional Execution Failures

» An Empirical Study of Tracing Techniques from a Failure Analysis Perspective

» An OrderSorted Resolution with Implicitly Negative Sorts

» Abducing through negation as failure stable models within the independent choice logic

» Modal Provability Foundations for Negation by Failure

» Next Steps for Description Logics of Minimal Knowledge and Negation as Failure

Post Info
More Details (n/a)

Added	07 Jul 2010
Updated	07 Jul 2010
Type	Conference
Year	2003
Where	ICLP
Authors	Davy Van Nieuwenborgh, Dirk Vermeir

Comments (0)