Sciweavers

400 search results - page 54 / 80
» Backtracking
Sort
View
LPAR
2005
Springer
14 years 2 months ago
Deciding Separation Logic Formulae by SAT and Incremental Negative Cycle Elimination
Separation logic is a subset of the quantifier-free first order logic. It has been successfully used in the automated verification of systems that have large (or unbounded) inte...
Chao Wang, Franjo Ivancic, Malay K. Ganai, Aarti G...
PPDP
2005
Springer
14 years 1 months ago
Monadic concurrent linear logic programming
Lolli is a logic programming language based on the asynchronous propositions of intuitionistic linear logic. It uses a backward chaining, backtracking operational semantics. In th...
Pablo López, Frank Pfenning, Jeff Polakow, ...
SAT
2005
Springer
107views Hardware» more  SAT 2005»
14 years 1 months ago
Local and Global Complete Solution Learning Methods for QBF
Solvers for Quantified Boolean Formulae (QBF) use many analogues of technique from SAT. A significant amount of work has gone into extending conflict based techniques such as co...
Ian P. Gent, Andrew G. D. Rowley
SAT
2005
Springer
145views Hardware» more  SAT 2005»
14 years 1 months ago
A New Approach to Model Counting
We introduce ApproxCount, an algorithm that approximates the number of satisfying assignments or models of a formula in propositional logic. Many AI tasks, such as calculating degr...
Wei Wei, Bart Selman
SPIN
2005
Springer
14 years 1 months ago
Repairing Structurally Complex Data
We present a novel algorithm for repairing structurally complex data. Given an assertion that represents desired structural integrity constraints and a structure that violates them...
Sarfraz Khurshid, Iván García, Yuk L...