2585 search results - page 281 / 517 » Automating Coherent Logic |
164
click to vote
CSL
2007
Springer
16 years 25 days ago
2007
Springer
Abstract. Although Cai, F¨urer and Immerman have shown that fixedpoint logic with counting (IFP + C) does not express all polynomialtime properties of finite structures, there h...
161
Voted
LICS
2005
IEEE
16 years 7 days ago
2005
IEEE
We consider unranked trees, that have become an active subject of study recently due to XML applications, and characterize commonly used fragments of firstorder (FO) and monadic ...
161
click to vote
DEON
2004
Springer
16 years 1 days ago
2004
Springer
This paper studies the logic of a dyadic modal operator for being obliged to meet a condition ρ before a condition δ becomes true. Starting from basic intuitions we arrive at a s...
173
click to vote
ICLP
2004
Springer
16 years 18 hour ago
2004
Springer
Abstract. We study termination of logic programs with dynamic scheduling, as it can be realised using delay declarations. Following previous work, our minimum assumption is that de...
151
click to vote
TPHOL
2003
IEEE
15 years 12 months ago
2003
IEEE
MetaPRL is the latest system to come out of over twenty five years of research by the Cornell PRL group. While initially created at Cornell, MetaPRL is currently a collaborative p...