Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Nonmonotonic Reasoning as SAT Search Department of Computer Science
 

Summary: Nonmonotonic Reasoning as SAT Search
Eyal Amir
Department of Computer Science
Gates Building 2A
Stanford University, Stanford, CA 94305­9020, USA
eyala@cs.stanford.edu
November 28, 1997
Abstract
In this paper we show that there is a direct correspondence between
prioritized propositional nonmonotonic reasoning and SAT search. This
correspondence leads to two results. First, we can reason efficiently us­
ing a SAT oracle. We explore several algorithms for finding models for
prioritized propositional circumscriptive theories and show that there are
some cases where some of the models can not be found using these algo­
rithms. Second, we see how search control, such as heuristic information,
is translated to defaults and priorities in a propositional nonmonotonic
theory.
1 Introduction
The motivations for this work are the search for an efficient mode of reasoning,
the formalization of control knowledge, and recent advances in satisfiability

  

Source: Amir, Eyal - Department of Computer Science, University of Illinois at Urbana-Champaign

 

Collections: Computer Technologies and Information Sciences