2022 search results - page 111 / 405 » Complexity of Non-Monotonic Logics |
101
Voted
AUSAI
2006
Springer
15 years 4 months ago
2006
Springer
This paper explores logical properties of belief-revision-based bargaining solution. We first present a syntax-independent construction of bargaining solution based on prioritized ...
92
Voted
AAAI
2007
15 years 3 months ago
2007
The purpose of this paper is to extend the notions of prime implicates and prime implicants to the basic modal logic K. We consider a number of different potential definitions of...
100
Voted
DAGSTUHL
2006
15 years 2 months ago
2006
In the first part, we introduce binary representations of both lambda calculus and combinatory logic terms, and demonstrate their simplicity by providing very compact parser-inter...
111
Voted
DLOG
2006
15 years 2 months ago
2006
Tree automata are often used for satisfiability testing in the area of description logics, which usually yields ExpTime complexity results. We examine conditions under which this ...
101
click to vote
LOGCOM
2002
15 years 13 days ago
2002
This paper defines and examines model checking games for the branching time temporal logic CTL . The games employ a technique called focus which enriches sets by picking out one d...