Sciweavers

641 search results - page 11 / 129
» Embedding Finite Sets in a Logic Programming Language
Sort
View
AAAI
2004
13 years 9 months ago
Logic Programs with Abstract Constraint Atoms
We propose and study extensions of logic programming with constraints represented as generalized atoms of the form C(X), where X is a finite set of atoms and C is act constraint (...
Victor W. Marek, Miroslaw Truszczynski
FOIKS
2004
Springer
14 years 1 months ago
Implementing Ordered Choice Logic Programming using Answer Set Solvers
Abstract. Ordered Choice Logic Programming (OCLP) allows for dynamic preference-based decision-making with multiple alternatives without the need for any form of negation. This com...
Marina De Vos
ESOP
2003
Springer
14 years 1 months ago
Finite Differencing of Logical Formulas for Static Analysis
Abstract. This paper concerns mechanisms for maintaining the value of an instrumentation predicate (a.k.a. derived predicate or view), defined via a logical formula over core pred...
Thomas W. Reps, Shmuel Sagiv, Alexey Loginov
FLOPS
2008
Springer
13 years 9 months ago
Declarative Diagnosis of Missing Answers in Constraint Functional-Logic Programming
Abstract. We present a declarative method for diagnosing missing computed answers in CFLP(D), a generic scheme for lazy Constraint Functional-Logic Programming which can be instant...
Rafael Caballero, Mario Rodríguez-Artalejo,...
JAIR
2012
211views Hardware» more  JAIR 2012»
11 years 10 months ago
Reformulating the Situation Calculus and the Event Calculus in the General Theory of Stable Models and in Answer Set Programming
Circumscription and logic programs under the stable model semantics are two wellknown nonmonotonic formalisms. The former has served as a basis of classical logic based action for...
Joohyung Lee, Ravi Palla