109 search results - page 17 / 22 » One useful logic that defines its own truth |
JELIA
1990
Springer
13 years 11 months ago
1990
Springer
Traditional accounts of the semantic interpretation of quantified phrases and its interaction with reference and ellipsis have relied on formal manipulations of logical forms (qua...
DLT
2010
13 years 9 months ago
2010
It is known that the languages definable by formulae of the logics FO2[<,S], 2[<,S], LTL[F,P,X,Y] are exactly the variety DAD. Automata for this class are not known, nor is i...
CAV
1998
Springer
13 years 11 months ago
1998
Springer
As a pedagogical exercise in ACL2, we formalize and prove the correctness of a write invalidate cache scheme. In our formalization, an arbitrary number of processors, each with its...
DLOG
2009
13 years 5 months ago
2009
Abstract. In this paper, we describe an approach for ontology comprehension support called model exploration in which models for ontologies are generated and presented interactivel...
CICLING
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. In this paper, we present a method for the automatic acquisition of semantic-based reformulations from natural language questions. Our goal is to find useful and generic ...