154 search results - page 16 / 31 » Proof Complexity of Non-classical Logics |
177
click to vote
CSL
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. In classical approaches to knowledge representation, reasoners are assumed to derive all the logical consequences of their knowledge base. As a result, reasoning in the ï...
140
click to vote
AUSAI
2007
Springer
16 years 3 days ago
2007
Springer
In this paper we show how to capture dialogue games in Defeasible Logic. We argue that Defeasible Logic is a natural candidate and general representation formalism to capture dialo...
191
click to vote
CADE
2009
Springer
16 years 6 months ago
2009
Springer
In recent years researchers have developed a wide range of powerful automated reasoning systems. We have leveraged these systems to build Jahob, a program specification, analysis, ...
155
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
The methods used to establish PSPACE-bounds for modal logics can roughly be grouped into two classes: syntax driven methods establish that exhaustive proof search can be performed...
267
click to vote
POPL
2006
ACM
16 years 6 months ago
2006
ACM
Embedded code pointers (ECPs) are stored handles of functions and continuations commonly seen in low-level binaries as well as functional or higher-order programs. ECPs are known ...