4573 search results - page 275 / 915 » Automated Reasoning |
169
Voted
DLOG
1997
15 years 8 months ago
1997
We describe a method for characterizing the expressive power of description logics. The method is essentially model-theoretic in nature, and it is applied to obtain expressiveness...
165
click to vote
CSL
2010
Springer
15 years 7 months ago
2010
Springer
We describe the formalisation of the normal forms of context-free grammars (CFGs) using the HOL4 theorem prover. These straightforward pen and paper proofs easily understood from t...
178
click to vote
CSL
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. This paper shows undecidability of type-checking and typeinference problems in domain-free typed lambda-calculi with existential types: a negation and conjunction fragmen...
166
click to vote
DLOG
2008
15 years 7 months ago
2008
Following the approaches and motivations given in recent works about action languages over description logics, we propose an action formalism based on a constructive semantics for ...
189
click to vote
CSL
2006
Springer
15 years 6 months ago
2006
Springer
Model-checking problems for PDL (propositional dynamic logic) and its extension PDL (which includes the intersection operator on programs) over various classes of infinite state sy...