Sciweavers

4513 search results - page 32 / 903
» Logic programming with satisfiability
Sort
View
PODS
2009
ACM
122views Database» more  PODS 2009»
15 years 10 months ago
Satisfiability of downward XPath with data equality tests
In this work we investigate the satisfiability problem for the logic XPath( , , =), that includes all downward axes as well as equality and inequality tests. We address this probl...
Diego Figueira
CADE
2002
Springer
15 years 10 months ago
The Quest for Efficient Boolean Satisfiability Solvers
The classical NP-complete problem of Boolean Satisfiability (SAT) has seen much interest in not just the theoretical computer science community, but also in areas where practical s...
Lintao Zhang, Sharad Malik
ICLP
1991
Springer
15 years 1 months ago
Abstract Interpretation of Logic Programs
Interpretation of Logic Programs 1
Patrick Cousot
PLDI
2009
ACM
15 years 10 months ago
A decision procedure for subset constraints over regular languages
Reasoning about string variables, in particular program inputs, is an important aspect of many program analyses and testing frameworks. Program inputs invariably arrive as strings...
Pieter Hooimeijer, Westley Weimer
CORR
2008
Springer
107views Education» more  CORR 2008»
14 years 10 months ago
Symmetry Breaking for Maximum Satisfiability
Symmetries are intrinsic to many combinatorial problems including Boolean Satisfiability (SAT) and Constraint Programming (CP). In SAT, the identification of symmetry breaking pred...
João Marques-Silva, Inês Lynce, Vasco...