Sciweavers

38 search results - page 7 / 8
» Reducing signed propositional formulas
Sort
View
CSL
1995
Springer
14 years 1 months ago
Deduction by Combining Semantic Tableaux and Integer Programming
In this paper we propose to extend the current capabilities of automated reasoning systems by making use of techniques from integer programming. We describe the architecture of an ...
Bernhard Beckert, Reiner Hähnle
ESWS
2006
Springer
14 years 1 months ago
Encoding Classifications into Lightweight Ontologies
Classifications have been used for centuries with the goal of cataloguing and searching large sets of objects. In the early days it was mainly books; lately it has also become Web ...
Fausto Giunchiglia, Maurizio Marchese, Ilya Zaihra...
ECAI
2004
Springer
14 years 3 months ago
New Insights on the Intuitionistic Interpretation of Default Logic
In this work we further investigate the relation, first found by Truszczy´nski, between modal logic S4F and Default Logic (DL), analyzing some interesting properties and showing ...
Pedro Cabalar, David Lorenzo
AAAI
2008
14 years 3 days ago
Lifted First-Order Belief Propagation
Unifying first-order logic and probability is a long-standing goal of AI, and in recent years many representations combining aspects of the two have been proposed. However, infere...
Parag Singla, Pedro Domingos
DATE
2008
IEEE
122views Hardware» more  DATE 2008»
14 years 4 months ago
Simulation-Directed Invariant Mining for Software Verification
With the advance of SAT solvers, transforming a software program to a propositional formula has generated much interest for bounded model checking of software in recent years. How...
Xueqi Cheng, Michael S. Hsiao