See this document in CiteSeerX!

Revising Propositional Horn Clause Knowledge Bases  (Make Corrections)  
Foto Afrati Ntu Athens Theodoros G. Kavalieros Ntu...



  Home/Search   Context   Related

 
View or download:
softlab.ece.ntua.gr/public/AD/fo...4.ps
inria.fr/associations/ERC...1194R034.ps
softlab.ntua.gr/facilities/publi...4.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  softlab.ece.ntua.gr/...postscript (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: We investigate the problem of revising a propositional knowledge base, viewed as a set of Horn clauses. We present algorithms that revise the knowledge base with a Horn clause according to the Set of Theories [Fagin and Ullman and Vardi] and the When In Doubt Through It Out approaches [Ginsberg]. Under the first approach the problem has shown to be intractable even when further restrictions are applied. We show that the algorithms run in polynomial time in the case where the number of... (Update)

Similar documents based on text:   More   All
0.2:   On the Expressiveness of Query Languages with Linear.. - Foto Afrati (1997)   (Correct)
0.2:   Linear vs. Polynomial Constraints in Database Query.. - Afrati, Cosmadakis.. (1994)   (Correct)
0.2:   Answering Queries Using Materialized Views with.. - Afrati, Gergatsoulis.. (1999)   (Correct)

BibTeX entry:   (Update)

@misc{ afrati-revising,
  author = "Foto Afrati",
  title = "Revising Propositional Horn Clause Knowledge Bases",
  url = "citeseer.ist.psu.edu/193496.html" }
Citations (may not include all citations):
4212   Computers and intractability - A Guide to the Theory of NP-c.. (context) - Garey, Jonhson - 1979
309   Symbolic Logic and Mechanical Theorem Proving (context) - Chang, Lee - 1973
200   the difference between updating a knowledge base and revisin.. - Katsuno, Mendelson - 1991
199   Reasoning about action using a possible models approach (context) - Wilkins - 1988
188   Knowledge in flux: Modeling the Dynamics of Epistemic states (context) - Gardenfors - 1988
156   Propositional knowledge base revision and minimal change (context) - Katsuno, Mendelson - 1991
149   the logic of theory change: partial meet contraction and rev.. (context) - Alchourr'on, Gardenfors et al. - 1985
97   Knowledge compilation using horn approximations - Kautz, Selman - 1991
96   the complexity of propositional knowledge base revision - Eiter, Gottlob - 1992
96   the semantics of updates in databases (context) - Fagin, Ullman et al. - 1983
72   Updating logical databases (context) - Wilkins - 1990
72   Belief revision and default reasoning: syntax based approach.. - Nebel - 1991
59   Language features for flexible handling of exceptions in inf.. - Borgida - 1985
56   A knowledge level analysis of belief revision - Nebel - 1989
49   Horn approximations of empirical data - Kautz, Kearns et al.

[Article contains additional citations not shown here]

Documents on the same site (http://softlab.ece.ntua.gr/public/AD/foto/postscript.html):   More
On Transformations into Linear Database Logic Programs - Foto Afrati (1996)   (Correct)
On the Expressiveness of First-Order Constraint Languages - Afrati, Andronikos.. (1995)   (Correct)
The expressiveness of Datalog circuits (DAC) - Afrati, GUESSARIAN, de ROUGEMONT   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC