Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

31

COLT
1999
Springer

favoriteEmaildiscussreport

89views Machine Learning» more COLT 1999»

On Theory Revision with Queries

14 years 3 months ago

On Theory Revision with Queries

Download www.cs.uky.edu

Abstract. A brief overview is given of recent results on theory revision with queries for propositional formulas, such as monotone and unate DNF, Horn formulas, read-once formulas, and threshold functions. Several open problems are formulated for revision in propositional and predicate logic, and ﬁnite automata.

Robert H. Sloan, György Turán

Real-time Traffic

COLT 1999 | Horn Formulas | Machine Learning | Propositional Formulas | Several Open Problems |

claim paper

Related Content

» Improved Algorithms for Theory Revision with Queries

» Theory revision with queries Horn readonce and parity formulas

» Semantic structures for onestage and iterated belief revision

» Revision Rules in the Theory of Evidence

» Sometimes Updates Are Circumscription

» Permissive Belief Revision

» Rational Belief Revision

» The Learning Power of Belief Revision

» Revising Beliefs Through Arguments Bridging the Gap Between Argumentation and Belief Revis...

Post Info
More Details (n/a)

Added	03 Aug 2010
Updated	03 Aug 2010
Type	Conference
Year	1999
Where	COLT
Authors	Robert H. Sloan, György Turán

Comments (0)