Sciweavers

1017 search results - page 33 / 204
» Higher-Order Logic Programming Languages with Constraints: A...
Sort
View
POPL
2011
ACM
14 years 14 days ago
Decidable logics combining heap structures and data
We define a new logic, STRAND, that allows reasoning with heapmanipulating programs using deductive verification and SMT solvers. STRAND logic (“STRucture ANd Data” logic) f...
P. Madhusudan, Gennaro Parlato, Xiaokang Qiu
AMAI
2008
Springer
14 years 9 months ago
Stable models and difference logic
The paper studies the relationship between logic programs with the stable model semantics and difference logic recently considered in the Satisfiability Modulo Theories framework....
Ilkka Niemelä
66
Voted
AMAI
2004
Springer
15 years 3 months ago
The Expressive Rate of Constraints
In reasoning tasks involving logical formulas, high expressiveness is desirable, although it often leads to high computational complexity. We study a simple measure of expressiven...
Hubie Chen
KDD
2008
ACM
146views Data Mining» more  KDD 2008»
15 years 10 months ago
Constraint programming for itemset mining
The relationship between constraint-based mining and constraint programming is explored by showing how the typical constraints used in pattern mining can be formulated for use in ...
Luc De Raedt, Tias Guns, Siegfried Nijssen
79
Voted
ICLP
2004
Springer
15 years 3 months ago
On Programs with Linearly Ordered Multiple Preferences
The extended answer set semantics for logic programs allows for the defeat of rules to resolve contradictions. We propose a refinement of these semantics based on a preference rel...
Davy Van Nieuwenborgh, Stijn Heymans, Dirk Vermeir