414 search results - page 49 / 83 » Resolution for Intuitionistic Logic |
TLCA
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Programming languages theory is full of problems that reduce to proving the consistency of a logic, such as the normalization of typed lambda-calculi, the decidability of...
IANDC
2010
13 years 6 months ago
2010
Categorial grammars in the tradition of Lambek [18, 19] are asymmetric: sequent statements are of the form Γ ⇒ A, where the succedent is a single formula A, the antecedent a st...
PDP
2005
IEEE
14 years 1 months ago
2005
IEEE
Boolean Equation Systems (BESs) allow to represent various problems encountered in the area of propositional logic programming and verification of concurrent systems. Several seq...
CRIWG
2007
13 years 9 months ago
2007
Abstract. This paper describes a groupware prototype addressing the alternative resolution of legal conflicts. The groupware prototype integrates the storytelling and argumentation...
NAACL
2007
13 years 9 months ago
2007
Traditional noun phrase coreference resolution systems represent features only of pairs of noun phrases. In this paper, we propose a machine learning method that enables features ...