Sciweavers

91 search results - page 4 / 19
» On Computing Backbones of Propositional Theories
Sort
View
IJCAI
1993
13 years 6 months ago
Symbolic Revision of Theories with M-of-N Rules
This paper presents a major revision of the Either propositional theory re nement system. Two issues are discussed. First, we show howrun timee ciency can be greatlyimproved by ch...
Paul T. Baffes, Raymond J. Mooney
CORR
2008
Springer
148views Education» more  CORR 2008»
13 years 3 months ago
Efficiently Simulating Higher-Order Arithmetic by a First-Order Theory Modulo
In deduction modulo, a theory is not represented by a set of axioms but by a congruence on propositions modulo which the inference rules of standard deductive systems--such as for ...
Guillaume Burel
LPNMR
2009
Springer
13 years 12 months ago
Translating Preferred Answer Set Programs to Propositional Logic
Abstract. We consider the problem of whether a given preferred answer set program can be reduced to a propositional formula. Research on this topic is of both theoretical and pract...
Vernon Asuncion, Yan Zhang
INFORMATICALT
2010
91views more  INFORMATICALT 2010»
13 years 3 months ago
An Expansion of the Neural Network Theory by Introducing Hebb Postulate
In the presented paper, some issues of the fundamental classical mechanics theory in the sense of Ising physics are introduced into the applied neural network area. The expansion o...
Algis Garliauskas
AI
2008
Springer
13 years 5 months ago
Modelling and solving temporal reasoning as propositional satisfiability
Representing and reasoning about time dependent information is a key research issue in many areas of computer science and artificial intelligence. One of the best known and widely...
Duc Nghia Pham, John Thornton, Abdul Sattar