22 search results - page 2 / 5 » Formulas for which Contraction is Admissible |
AI
2011
Springer
13 years 10 days ago
2011
Springer
The binary relation framework has been shown to be applicable to many real-life preference handling scenarios. Here we study preference contraction: the problem of discarding sele...
IGPL
1998
13 years 5 months ago
1998
Is it possible to compute in which logics a given formula is deducible? The aim of this paper is to provide a formal basis to answer positively this question in the context of sub...
AIML
2006
13 years 6 months ago
2006
In [9] we developed a semantics for quantified relevant logic that uses general frames. In this paper, we adapt that model theory to treat quantified modal logics, giving a complet...
IJCAI
2003
13 years 6 months ago
2003
We study two apparently different, but formally similar, scheduling problems. The first problem involves contract algorithms, which can trade off run time for solution quality, a...
CSL
2005
Springer
13 years 10 months ago
2005
Springer
We give a Natural Deduction formulation of an adaptation of G¨odel’s functional (Dialectica) interpretation to the extraction of (more) efficient programs from (classical) proof...