Sciweavers

5 search results - page 1 / 1
» Deciding Effectively Propositional Logic Using DPLL and Subs...
Sort
View
CADE
2008
Springer
13 years 6 months ago
Deciding Effectively Propositional Logic Using DPLL and Substitution Sets
We introduce a DPLL calculus that is a decision procedure for the Bernays-Sch
Leonardo Mendonça de Moura, Nikolaj Bj&osla...
AUSAI
2004
Springer
13 years 10 months ago
Embedding Memoization to the Semantic Tree Search for Deciding QBFs
Abstract. Quantified Boolean formulas (QBFs) play an important role in artificial intelligence subjects, specially in planning, knowledge representation and reasoning [20]. In th...
Mohammad GhasemZadeh, Volker Klotz, Christoph Mein...
DAC
2006
ACM
14 years 5 months ago
Predicate learning and selective theory deduction for a difference logic solver
Design and verification of systems at the Register-Transfer (RT) or behavioral level require the ability to reason at higher levels of abstraction. Difference logic consists of an...
Chao Wang, Aarti Gupta, Malay K. Ganai
JSYML
2002
170views more  JSYML 2002»
13 years 4 months ago
Representability in Second-Order Propositional Poly-Modal Logic
A propositional system of modal logic is second-order if it contains quantifiers p and p, which, in the standard interpretation, are construed as ranging over sets of possible worl...
Gian Aldo Antonelli, Richmond H. Thomason
CORR
2010
Springer
194views Education» more  CORR 2010»
13 years 1 months ago
A Focused Sequent Calculus Framework for Proof Search in Pure Type Systems
Basic proof search tactics in logic and type theory can be seen as the root-rst applications of rules in an appropriate sequent calculus, preferably without the redundancies gener...
Stéphane Lengrand, Roy Dyckhoff, James McKi...