Sciweavers

158 search results - page 23 / 32
» LPForget: A System of Forgetting in Answer Set Programming
Sort
View
AICOM
2006
129views more  AICOM 2006»
13 years 7 months ago
A backjumping technique for Disjunctive Logic Programming
In this work we present a backjumping technique for Disjunctive Logic Programming (DLP) under the Answer Set Semantics. It builds upon related techniques that had originally been p...
Francesco Ricca, Wolfgang Faber, Nicola Leone
VMCAI
2007
Springer
14 years 1 months ago
Better Under-Approximation of Programs by Hiding Variables
Abstraction frameworks use under-approximating transitions in order to prove existential properties of concrete systems. Under-approximating transifer to the concrete states that c...
Thomas Ball, Orna Kupferman
LADS
2007
Springer
14 years 1 months ago
Facilitating Agent Development in Open Distributed Systems
One of the main reasons about the success of the Web is that many “regular users” are able to create Web pages that, using hyperlinks, incrementally extend both the size and th...
Mauro Gaspari, Davide Guidi
DEXA
1994
Springer
92views Database» more  DEXA 1994»
13 years 11 months ago
OR-SML: A Functional Database Programming Language for Disjunctive Information and Its Applications
We describe a functional database language OR-SML for handling disjunctive information in database queries, and its implementation on top of Standard ML 12]. The core language has ...
Elsa L. Gunter, Leonid Libkin
COMMA
2010
13 years 2 months ago
Dialectical Proofs for Constrained Argumentation
Abstract. Constrained argumentation frameworks (CAF) generalize Dung's frameworks by allowing additional constraints on arguments to be taken into account in the definition of...
Caroline Devred, Sylvie Doutre, Claire Lefè...