LPAR
2005
Springer
13 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...
LPAR
2005
Springer
13 years 10 months ago
2005
Springer
ECKING ABSTRACT STATE MACHINES WITH ANSWER SET PROGRAMMING by Calvin Kai Fan Tang B.Sc., Simon Fraser University, 2003 a thesis submitted in partial fulfillment of the requirements...
LPAR
2005
Springer
13 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...
LPAR
2005
Springer
13 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...
LPAR
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We describe an environment that allows the users of the Theorema system to flexibly control aspects of computer-supported proof development. The environment supports the...
LPAR
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. The paper describes the formalization and implementation of an efficient constraint programming framework operating on 3D crystal lattices. The framework is motivated an...
LPAR
2005
Springer
13 years 10 months ago
2005
Springer
LPAR
2005
Springer
13 years 10 months ago
2005
Springer
An overview is given of a number of recent developments in SAT and SAT Modulo Theories (SMT). In particular, based on our k of Abstract DPLL and Abstract DPLL modulo Theories, we e...
LPAR
2005
Springer
13 years 10 months ago
2005
Springer
LPAR
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. The mechanisation of proofs for probabilistic systems is particularly challenging due to the verification of real-valued properties that probability entails: experience ...