Sciweavers

154 search results - page 24 / 31
» Proof Complexity of Non-classical Logics
Sort
View
CADE
1998
Springer
15 years 2 months ago
System Description: leanK 2.0
Abstract. leanK is a "lean", i.e., extremely compact, Prolog implementation of a free variable tableau calculus for propositional modal logics. leanK 2.0 includes additio...
Bernhard Beckert, Rajeev Goré
GLVLSI
2007
IEEE
171views VLSI» more  GLVLSI 2007»
15 years 4 months ago
Combinational equivalence checking for threshold logic circuits
Threshold logic is gaining prominence as an alternative to Boolean logic. The main reason for this trend is the availability of devices that implement these circuits efficiently (...
Tejaswi Gowda, Sarma B. K. Vrudhula, Goran Konjevo...
CLIMA
2004
14 years 11 months ago
Weighted Multi Dimensional Logic Programs
Abstract. We introduce a logical framework suitable to formalize structures of epistemic agents. Such a framework is based on the notion of weighted directed acyclic graphs (WDAGs)...
Pierangelo Dell'Acqua
LFCS
2007
Springer
15 years 4 months ago
Realizations and LP
LP can be seen as a logic of knowledge with justifications. Artemov’s Realization Theorem says justifications can be extracted from validities in the more conventional Hintikk...
Melvin Fitting
AIML
2008
14 years 11 months ago
Labelled modal tableaux
Labelled tableaux are extensions of semantic tableaux with annotations (labels, indices) whose main function is to enrich the modal object language with semantic elements. This pap...
Guido Governatori