Sciweavers

2303 search results - page 188 / 461
» On the logic of argumentation theory
Sort
View
MATES
2004
Springer
15 years 12 months ago
Paraconsistent Assertions
Classical logic predicts that everything (thus nothing useful at all) follows from inconsistency. A paraconsistent logic is a logic where inconsistency does not lead to such an exp...
Jørgen Villadsen
CADE
2007
Springer
16 years 6 months ago
T-Decision by Decomposition
Much research concerning Satisfiability Modulo Theories is devoted to the design of efficient SMT-solvers that integrate a SATsolver with T -satisfiability procedures. The rewrite-...
Maria Paola Bonacina, Mnacho Echenim
CADE
2004
Springer
16 years 6 months ago
Decision Procedures for Recursive Data Structures with Integer Constraints
This paper is concerned with the integration of recursive data structures with Presburger arithmetic. The integrated theory includes a length function on data structures, thus prov...
Ting Zhang, Henny B. Sipma, Zohar Manna
CORR
2002
Springer
85views Education» more  CORR 2002»
15 years 6 months ago
The partition semantics of questions, syntactically
Groenendijk and Stokhof (1984, 1996; Groenendijk 1999) provide a logically attractive theory of the semantics of natural language questions, commonly referred to as the partition t...
Chung-chieh Shan, Balder ten Cate
POPL
2004
ACM
16 years 6 months ago
Extensional normalisation and type-directed partial evaluation for typed lambda calculus with sums
We present a notion of -long ? -normal term for the typed lambda calculus with sums and prove, using Grothendieck logical relations, that every term is equivalent to one in norm...
Vincent Balat, Roberto Di Cosmo, Marcelo P. Fiore