3053 search results - page 118 / 611 » A Logic of Abstract Argumentation |
179
click to vote
AML
2002
15 years 6 months ago
2002
Abstract We extend Barbanera and Berardi's symmetric lambda calculus [2] to second order classical propositional logic and prove its strong normalization.
184
click to vote
DLOG
2007
15 years 8 months ago
2007
Abstract. This paper presents a tableau approach for deciding description logics outside the scope of OWL DL and current state-of-the-art tableau-based description logic systems. I...
152
click to vote
SIGCSE
1997
ACM
15 years 10 months ago
1997
ACM
Passing functions and function objects to general routines is a powerful abstraction mechanism that should be taught in freshman computer science. In C++, a “function” can be ...
164
click to vote
CADE
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. In this paper we present an extensional higher-order resolution calculus that is complete relative to Henkin model semantics. The treatment of the extensionality principl...
161
click to vote
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We prove that the boundedness problem for monadic secondorder logic over the class of all finite words is decidable.