154
click to vote
LPAR
15 years 10 months ago
2005 Springer 
We propose to build an automated reasoning system for first-order logic (FOL) by translating reasoning problems to a fragment of FOL called coherent logic (CL) and then solving t...
166
click to vote
LPAR
15 years 10 months ago
2005 Springer
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...
164
click to vote
LPAR
15 years 10 months ago
2005 Springer 
The notion of comparative similarity ‘X is more similar or closer to Y than to Z’ has been investigated in both foundational and applied areas of knowledge representation and r...
152
click to vote
LPAR
15 years 10 months ago
2005 Springer
Local search algorithms are one of the effective methods for solving hard combinatorial problems. However, a serious problem of this approach is that the search often traps at loca...
130
click to vote
LPAR
15 years 10 months ago
2005 Springer
We present an algorithm for the conversion of very weak alternating Büchi automata into nondeterministic Büchi automata (NBA), and we introduce a local optimization criterion fo...
|
Automated Reasoning