Sciweavers

33 search results - page 5 / 7
» The Boolean Constraint Solver of SWI-Prolog (System Descript...
Sort
View
PLDI
2004
ACM
13 years 11 months ago
Jedd: a BDD-based relational extension of Java
In this paper we present Jedd, a language extension to Java that supports a convenient way of programming with Binary Decision Diagrams (BDDs). The Jedd language abstracts BDDs as...
Ondrej Lhoták, Laurie J. Hendren
DLOG
1998
13 years 7 months ago
Comparing Subsumption Optimizations
Effective systems for expressive description logics require a heavily-optimised subsumption checker incorporating a range of optimisation techniques. Because of the correspondence...
Ian Horrocks, Peter F. Patel-Schneider
AGP
1999
IEEE
13 years 10 months ago
ACI1 constraints
Disunification is the problem of deciding satisfiability of a system of equations and disequations with respect to a given equational theory. In this paper we study the disunifica...
Agostino Dovier, Carla Piazza, Enrico Pontelli, Gi...
CPAIOR
2010
Springer
13 years 5 months ago
Automatically Exploiting Subproblem Equivalence in Constraint Programming
Many search problems contain large amounts of redundancy in the search. In this paper we examine how to automatically exploit remaining subproblem equivalence, which arises when tw...
Geoffrey Chu, Maria Garcia de la Banda, Peter J. S...
CADE
2010
Springer
13 years 7 months ago
MUNCH - Automated Reasoner for Sets and Multisets
This system description provides an overview of the MUNCH reasoner for sets and multisets. MUNCH takes as the input a formula in a logic that supports expressions about sets, multi...
Ruzica Piskac, Viktor Kuncak