3773 search results - page 250 / 755 » Logical Reasoning |
217
click to vote
ECSQARU
2005
Springer
16 years 4 days ago
2005
Springer
Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating as well t...
175
click to vote
JANCL
2002
15 years 6 months ago
2002
Consistency-based approaches in nonmonotonic reasoning may be expected to yield multiple sets of default conclusions for a given default theory. Reasoning about such extensions is ...
164
click to vote
CSL
2002
Springer
15 years 6 months ago
2002
Springer
Abstract. We give a simple term calculus for the multiplicative exponential fragment of Classical Linear Logic, by extending Barber and Plotkin's system for the intuitionistic...
196
click to vote
CSL
1995
Springer
15 years 10 months ago
1995
Springer
We propose so called contraction free sequent calculi for the three prominent modal logics K, T, and S4. Deduction search in these calculi is shown to provide more efficient decisi...
145
click to vote
ICLP
1995
Springer
15 years 10 months ago
1995
Springer
The purpose of this paper is to study the problem of complete type inferencing for polymorphic order-sorted logic programs. We show that previous approaches are incomplete even if...