221 search results - page 21 / 45 » Encoding Modal Logics in Logical Frameworks |
LOGCOM
2002
13 years 7 months ago
2002
In this paper we present a labelled proof method for computing nonmonotonic consequence relations in a conditional logic setting. The method exploits the strong connection between...
TABLEAUX
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. In this paper we present a labelled proof method for computing nonmonotonic consequence relations in a conditional logic setting. The method is based on the usual possibl...
UAI
2004
13 years 9 months ago
2004
Defeasible argumentation frameworks have evolved to become a sound setting to formalize commonsense, qualitative reasoning from incomplete and potentially inconsistent knowledge. ...
ENTCS
2007
13 years 7 months ago
2007
We formalize in the logical framework ATS/LF a proof based on Tait’s method that establishes the simply-typed lambda-calculus being strongly normalizing. In malization, we emplo...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. Logic Programming languages and combinational circuit synthesis tools share a common "combinatorial search over logic formulae" background. This paper attempts ...