Sciweavers

49 search results - page 4 / 10
» MaLARea: a Metasystem for Automated Reasoning in Large Theor...
Sort
View
CADE
2007
Springer
14 years 6 months ago
Solving Quantified Verification Conditions Using Satisfiability Modulo Theories
Abstract. First order logic provides a convenient formalism for describing a wide variety of verification conditions. Two main approaches to checking such conditions are pure first...
Yeting Ge, Clark Barrett, Cesare Tinelli
KR
2004
Springer
13 years 11 months ago
A Logic of Limited Belief for Reasoning with Disjunctive Information
The goal of producing a general purpose, semantically motivated, and computationally tractable deductive reasoning service remains surprisingly elusive. By and large, approaches t...
Yongmei Liu, Gerhard Lakemeyer, Hector J. Levesque
LICS
2007
IEEE
14 years 1 days ago
A Contraction Method to Decide MSO Theories of Deterministic Trees
In this paper we generalize the contraction method, originally proposed by Elgot and Rabin and later extended by Carton and Thomas, from labeled linear orderings to colored determ...
Angelo Montanari, Gabriele Puppis
KR
2000
Springer
13 years 9 months ago
A Logic Based Language for Parametric Inheritance
Though overriding as a single and default mode of inheritance is adequate for most knowledge bases, a large class of applications naturally requires several inheritance modes and ...
Hasan M. Jamil
CADE
2007
Springer
13 years 12 months ago
Semantic Selection of Premisses for Automated Theorem Proving
We develop and implement a novel algorithm for discovering the optimal sets of premisses for proving and disproving conjectures in first-order logic. The algorithm uses interpret...
Petr Pudlak