2035 search results - page 104 / 407 » On the complexity of stratified logics |
157
click to vote
AAAI
2007
15 years 8 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...
155
click to vote
DAGSTUHL
2006
15 years 7 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...
166
click to vote
DLOG
2006
15 years 7 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 ...
160
click to vote
LOGCOM
2002
15 years 6 months 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...
156
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
The IEEE standardized Property Specification Language, PSL for short, extends the well-known linear-time temporal logic LTL with so-called semi-extended regular expressions. PSL an...