Sciweavers

77 search results - page 3 / 16
» Reasoning by Cases without Contraposition in Default Logic
Sort
View
KI
2004
Springer
13 years 10 months ago
Model Based Deduction for Database Schema Reasoning
Abstract. We aim to demonstrate that automated deduction techniques, in particular those following the model computation paradigm, are very well suited for database schema/query re...
Peter Baumgartner, Ulrich Furbach, Margret Gro&szl...
LOGCOM
2006
90views more  LOGCOM 2006»
13 years 5 months ago
Transfer Results for Hybrid Logic. Part I: The Case Without Satisfaction Operators
For every Kripke complete modal logic L we define its hybrid companion LH . For a reasonable class of logics, we present a satisfiability-preserving translation from LH to L. We p...
Nick Bezhanishvili, Balder ten Cate
ECAI
1992
Springer
13 years 9 months ago
On the Impact of Stratification on the Complexity of Nonmonotonic Reasoning
ABSTRACT. This paper investigates the problem of finding subclasses of nonmonotonic reasoning which can be implemented efficiently. The ability to "define" propositions u...
Ilkka Niemelä, Jussi Rintanen
KR
1989
Springer
13 years 9 months ago
Impediments to Universal Preference-Based Default Theories
Research on nonmonotonic and default reasoning has identified several important criteria for preferring alternative default inferences. The theories of reasoning based on each of...
Jon Doyle, Michael P. Wellman
LPNMR
1997
Springer
13 years 9 months ago
Power Defaults
This paper introduces power default reasoning (PDR), a framework for nonmonotonic reasoning based on the domain-theoretic idea of modeling default rules with partial-information i...
Guo-Qiang Zhang, William C. Rounds