3470 search results - page 345 / 694 » Head-Elementary-Set-Free Logic Programs |
138
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
We prove that TAUT has a p-optimal proof system if and only if a logic related to least fixed-point logic captures polynomial time on all finite structures. Furthermore, we show ...
178
click to vote
SEFM
2005
IEEE
16 years 7 days ago
2005
IEEE
Verification of programs requires reasoning about sets of program states. In case of programs manipulating pointers, program states are pointer graphs. Verification of such prog...
150
click to vote
BIRTHDAY
2005
Springer
16 years 6 days ago
2005
Springer
We present an extension of first-order predicate logic with a novel predicate ‘at t’ meaning intuitively “this term is a variable symbol”. We give simple sequent proof-ru...
196
click to vote
CONCUR
2005
Springer
16 years 6 days ago
2005
Springer
The context of this study is timed temporal logics for timed automata. In this paper, we propose an extension of the classical logic TCTL with a new Until modality, called “Until...
177
click to vote
CSL
2006
Springer
15 years 10 months ago
2006
Springer
Game quantification is an expressive concept and has been studied in model theory and descriptive set theory, especially in relation to infinitary logics. Automatic structures on t...