827 search results - page 4 / 166 » Proof-Theoretic Soundness and Completeness |
TIC
2000
Springer
13 years 8 months ago
2000
Springer
Singleton kinds provide an elegant device for expressing type equality information resulting from modern module languages, but they can severely complicate the metatheory of langu...
KR
1992
Springer
13 years 9 months ago
1992
Springer
We describe the ucpop partial order planning algorithm which handles a subset of Pednault's ADL action representation. In particular, ucpop operates with actions that have co...
AAAI
1994
13 years 6 months ago
1994
We present a method of representing some classes of default theories as normal logic programs. The main point is that the standard semantics (i.e. SLDNF-resolution) computes answe...
TCS
2008
13 years 4 months ago
2008
This paper provides one more step towards bridging the gap between the formal and computational approaches to the verification of cryptographic protocols. We extend the well-known ...
WOLLIC
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We introduce a tree-sequent calculus for inquisitive logic (Groenendijk 2008) as a special form of labelled deductive system (Gabbay 1996). In particular, we establish th...