3891 search results - page 412 / 779 » A logic for strategic reasoning |
182
click to vote
CADE
2006
Springer
16 years 7 months ago
2006
Springer
In this paper, we discuss a lightweight approach to eliminate the overhead due to implicit type arguments during higher-order unification of dependently-typed terms. First, we show...
203
click to vote
ASP
2005
Springer
16 years 12 days ago
2005
Springer
Possibilistic Stable model Semantics is an extension of Stable Model Semantics that allows to merge uncertain and non monotonic reasoning into a unique framework. To achieve this a...
207
click to vote
CSL
2001
Springer
15 years 11 months ago
2001
Springer
We introduce the calculus of structures: it is more general than the sequent calculus and it allows for cut elimination and the subformula property. We show a simple extension of m...
185
click to vote
ICALP
2001
Springer
15 years 11 months ago
2001
Springer
We present a logical framework Υ for reasoning on a very general class of languages featuring binding operators, called nominal , presented in higher-order abstract syntax (HOAS)....
198
click to vote
CADE
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. aRa is an automatic theorem prover for various kinds of relation algebras. It is based on Gordeev’s Reduction Predicate Calculi for n-variable logic (RPCn) which allow ...