61 search results - page 12 / 13 » Tableaux for the Lambek-Grishin calculus |
181
click to vote
CADE
2008
Springer
15 years 8 months ago
2008
Springer
It is well known how to use an intuitionistic meta-logic to specify natural deduction systems. It is also possible to use linear logic as a meta-logic for the specification of a va...
189
click to vote
TABLEAUX
2009
Springer
16 years 18 days ago
2009
Springer
We consider two sequent calculi for tense logic in which the syntactic judgements are nested sequents, i.e., a tree of traditional onesided sequents built from multisets of formula...
152
click to vote
CADE
2007
Springer
16 years 6 months ago
2007
Springer
Abstract. Automata-based decision procedures commonly achieve optimal complexity bounds. However, in practice, they are often outperformed by sub-optimal (but more local-search bas...
133
click to vote
IGPL
2008
15 years 6 months ago
2008
In this paper we explore a generalization of traditional abduction which can simultaneously perform two different tasks: (i) given an unprovable sequent G, find a sentence H such ...
162
click to vote
ECAI
2010
Springer
15 years 7 months ago
2010
Springer
Non-standard reasoning in Description Logics (DLs) comprises computing a Least Common Subsumer (LCS), a Concept Difference, a Concept Unifier, or an Interpolant Concept, to name a ...