738 search results - page 147 / 148 » Prime Implicant Computation Using Satisfiability Algorithms |
SPATIALCOGNITION
2000
Springer
13 years 9 months ago
2000
Springer
The paper analyzes a diagrammatic reasoning problem that consists in finding a graphical layout which simultaneously satisfies a set of constraints expressed in a formal language a...
CAV
2008
Springer
13 years 7 months ago
2008
Springer
In this paper we address the problem of shape analysis for concurrent programs. We present new algorithms, based on abstract interpretation, for automatically verifying properties ...
ATAL
2006
Springer
13 years 7 months ago
2006
Springer
In this paper we present the internal architecture and bidding mechanisms designed for Mertacor, a successful trading agent, which ended up first in the Classic Trading Agent Comp...
FM
2008
Springer
13 years 7 months ago
2008
Springer
The declarative modeling language Alloy and its automatic analyzer provide an effective tool-set for building designs of systems and checking their properties. The Alloy Analyzer p...
AIML
2008
13 years 7 months ago
2008
In 1983, Valentini presented a syntactic proof of cut-elimination for a sequent calculus GLSV for the provability logic GL where we have added the subscript V for "Valentini&q...