2303 search results - page 60 / 461 » On the logic of argumentation theory |
205
click to vote
AAAI
1996
15 years 7 months ago
1996
This paper presents mathematical results that can sometimes be used to simplify the task of reasoning about a default theory, by \splitting it into parts." These so-called Sp...
191
click to vote
FOSSACS
2010
Springer
16 years 1 months ago
2010
Springer
Abstract. We lay the foundations of a first-order correspondence theory for coalgebraic logics that makes the transition structure explicit in the first-order modelling. In parti...
106
click to vote
JETAI
1998
15 years 5 months ago
1998
The proper treatment of computationalism, as the thesis that cognition is computable, is presented and defended. Some arguments of James H. Fetzer against computationalism are exam...
145
click to vote
MSCS
2008
15 years 6 months ago
2008
The idea of coercive subtyping, a theory of abbreviation for dependent type theories, is incorporated into the polymorphic type system in functional programming languages. The tra...
169
click to vote
JSYML
2008
15 years 6 months ago
2008
In this paper a method for the replacement, in formulas, of strong quantifiers by functions is introduced that can be considered as an alternative to Skolemization in the setting ...