Sciweavers

7991 search results - page 281 / 1599
» Using More Reasoning to Improve
Sort
View
FLOPS
2010
Springer
15 years 5 months ago
Proving Injectivity of Functions via Program Inversion in Term Rewriting
Injectivity is one of the important properties for functions while it is undecidable in general and decidable for linear treeless functions. In this paper, we show new sufficient c...
Naoki Nishida, Masahiko Sakai
ASP
2005
Springer
16 years 7 days ago
Nelson's Strong Negation, Safe Beliefs and the Answer Set Semantics
In this paper we consider an extension of the answer set semantics allowing arbitrary use of strong negation. We prove that the strong negation extension of any intermediate logic ...
Magdalena Ortiz, Mauricio Osorio
TPHOL
1997
IEEE
15 years 11 months ago
Type Classes and Overloading in Higher-Order Logic
Type classes and overloading are shown to be independent concepts that can both be added to simple higher-order logics in the tradition of Church and Gordon, without demanding more...
Markus Wenzel
IJCAI
1997
15 years 8 months ago
Analogy and Abduction in Automated Deduction
A method is presented for analogical reasoning in Automated Deduction. We focus on the abductive aspects of analogy and give a unified treatment for theorems and non-theorems. Abd...
Gilles Défourneaux, Nicolas Peltier
UAI
2000
15 years 8 months ago
Pivotal Pruning of Trade-offs in QPNs
Qualitative probabilistic networks have been designed for probabilistic reasoning in a qualitative way. Due to their coarse level of representation detail, qualitative probabilist...
Silja Renooij, Linda C. van der Gaag, Simon Parson...