6618 search results - page 395 / 1324 » Natural Logic for Natural Language |
172
click to vote
CADE
1997
Springer
15 years 11 months ago
1997
Springer
In this paper we study the completeness of resolution when it is restricted by a non-liftable order and by weak subsumption. A non-liftable order is an order that does not satisfy...
220
click to vote
ECAI
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. Interval temporal logics formalize reasoning about interval structures over (usually) linearly ordered domains, where time intervals are the primitive ontological entitie...
176
click to vote
ICECCS
2007
IEEE
16 years 1 months ago
2007
IEEE
In this paper we summarize parallel algorithms for enumerative model checking of properties formulated in linear time temporal logic (LTL) as well as a fragment of the µcalculus ...
197
click to vote
CSR
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. We prove a conjecture by A. Pnueli and strengthen it showing a sequence of "counting modalities" none of which is expressible in the temporal logic generated by...
194
click to vote
FMCAD
2008
Springer
15 years 9 months ago
2008
Springer
We present a general approach for verifying safety properties of Lustre programs automatically. Key aspects of the approach are the choice of an expressive first-order logic in wh...