article

Reasoning about evolving nonmonotonic knowledge bases

Authors:

Giuliana Sabbatini,

Hans TompitsAuthors Info & Claims

ACM Transactions on Computational Logic (TOCL), Volume 6, Issue 2

Pages 389 - 440

https://doi.org/10.1145/1055686.1055693

Published: 01 April 2005 Publication History

Abstract

Recently, several approaches to updating knowledge bases modeled as extended logic programs have been introduced, ranging from basic methods to incorporate (sequences of) sets of rules into a logic program, to more elaborate methods which use an update policy for specifying how updates must be incorporated. In this article, we introduce a framework for reasoning about evolving knowledge bases, which are represented as extended logic programs and maintained by an update policy. We first describe a formal model which captures various update approaches, and we define a logical language for expressing properties of evolving knowledge bases. We then investigate semantical and computational properties of our framework, where we focus on properties of knowledge states with respect to the canonical reasoning task of whether a given formula holds in a given evolving knowledge base. In particular, we present finitary characterizations of the evolution for certain classes of framework instances, which can be exploited for obtaining decidability results. In more detail, we characterize the complexity of reasoning for some meaningful classes of evolving knowledge bases, ranging from polynomial to double exponential space complexity.

References

[1]

Abiteboul, S., Vianu, V., Fordham, B. S., and Yesha, Y. 1998. Relational transducers for electronic commerce. In Proceedings of the 17th ACM SIGACT SIGMOD-SIGART Symposium on Principles of Database Systems (PODS'98). ACM, New York, 179--187.]]

Digital Library

[2]

Alferes, J., Leite, J., Pereira, L., Przymusinska, H., and Przymusinski, T. 1998. Dynamic logic programming. In Proceedings of the 6th International Conference on Principles of Knowledge Representation and Reasoning (KR'98), A. Cohn, L. Schubert, and S. Shapiro, Eds. Morgan-Kaufmann, San Francisco, Calif., 98--111.]]

[3]

Alferes, J., Leite, J., Pereira, L., Przymusinska, H., and Przymusinski, T. 2000. Dynamic updates of non-monotonic knowledge bases. J. Logic Prog. 45, 1--3, 43--70.]]

[4]

Alferes, J., Pereira, L., Przymusinska, H., and Przymusinski, T. 1999. LUPS---a language for updating logic programs. In Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'99), M. Gelfond, N. Leone, and G. Pfeifer, Eds. Lecture Notes in Artificial Intelligence, vol. 1730. Springer-Verlag, New York, 162--176.]]

Digital Library

[5]

Alferes, J., Pereira, L., Przymusinska, H., and Przymusinski, T. 2002. LUPS---a language for updating logic programs. Artif. Intell. 138, 1--2, 87--116.]]

Digital Library

[6]

Balcázar, J., Diaz, J., and Gabarró, J. 1988. Structural Complexity I. 2nd ed. Springer-Verlag, New York.]]

Digital Library

[7]

Baral, C., Kreinovich, V., and Trejo, R. 2000. Computational complexity of planning and approximate planning in the presence of incompleteness. Artif. Intell. 122, 1--2, 241--267.]]

Digital Library

[8]

Brewka, G. 1996. Well-founded semantics for extended logic programs with dynamic preferences. J. Artif. Intell. Res. 4, 19--36.]]

[9]

Brewka, G. 2000. Declarative representation of revision strategies. In Proceedings of the 14th European Conference on Artificial Intelligence (ECAI 2000), W. Horn, Ed. IOS Press.]]

Digital Library

[10]

Chomicki, J. 1995. Efficient checking of temporal integrity constraints using bounded history encoding. ACM Trans. Datab. Syst. 20, 2, 149--186.]]

Digital Library

[11]

Cimatti, A., Clarke, E., Giunchiglia, F., and Roveri, M. 2000. NuSMV: A new symbolic model checker. Int. J. Softw. Tools Tech. Transfer 2, 4, 410--425.]]

[12]

Clarke, E., Grumberg, O., and Peled, D. 1999. Model Checking. MIT Press, Cambridge, Mass.]]

Digital Library

[13]

Dantsin, E., Eiter, T., Gottlob, G., and Voronkov, A. 2001. Complexity and expressive power of logic programming. ACM Comput. Surv. 33, 3, 374--425.]]

Digital Library

[14]

Eiter, T., Fink, M., Sabbatini, G., and Tompits, H. 2000. Considerations on updates of logic programs. In Proceedings of the 7th European Workshop on Logics in Artificial Intelligence (JELIA 2000), M. Ojeda-Aciego, I. P. de Guzmán, G. Brewka, and L. Moniz Pereira, Eds. Lecture Notes in Computer Science, vol. 1919. Springer-Verlag, New York, 2--20.]]

Digital Library

[15]

Eiter, T., Fink, M., Sabbatini, G., and Tompits, H. 2001. A framework for declarative update specifications in logic programs. In Proceedings of the 17th International Joint Conference on Artificial Intelligence (IJCAI'01), B. Nebel, Ed. Morgan-Kaufmann, San Francisco, Calif., 649--654.]]

Digital Library

[16]

Eiter, T., Fink, M., Sabbatini, G., and Tompits, H. 2002. On properties of update sequences based on causal rejection. Theory Pract. Logic Prog. 2, 6, 721--777.]]

Digital Library

[17]

Eiter, T., Fink, M., Sabbatini, G., and Tompits, H. 2003. Declarative update policies for nonmonotonic knowledge bases. In Logics for Emerging Applications of Databases, J. Chomicki, R. van der Meyden, and G. Saake, Eds. Springer-Verlag, New York, Chapt. 3, 85--129.]]

[18]

Emerson, E. 1990. Temporal and modal logics. In Handbook of Theoretical Computer Science, J. van Leeuwen, Ed. Vol. B. Elsevier Science Publishers B.V. (North-Holland), Amsterdam, The Netherlands, Chapt. 16.]]

Digital Library

[19]

Fagin, R., Halpern, J., Moses, Y., and Vardi, M. 1995. Reasoning about Knowledge. MIT Press, Cambridge, Mass.]]

Digital Library

[20]

Gabbay, D. and Smets, PH. Eds. 1998. Handbook on Defeasible Reasoning and Uncertainty Management Systems. Vol. III: Belief Change. Kluwer Academic.]]

[21]

Gelfond, M. and Lifschitz, V. 1991. Classical negation in logic programs and disjunctive databases. New Gen. Comput. 9, 3--4, 365--385.]]

[22]

Inoue, K. and Sakama, C. 1995. Abductive framework for nonmonotonic theory change. In Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI'95). Morgan-Kaufmann, San Francisco, Calif., 204--210.]]

Digital Library

[23]

Inoue, K. and Sakama, C. 1999. Updating extended logic programs through abduction. In Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'99), M. Gelfond, N. Leone, and G. Pfeifer, Eds. Lecture Notes in Artificial Intelligence, vol. 1730. Springer-Verlag, New York, 147--161.]]

Digital Library

[24]

Leite, J. 2001. A modified semantics for LUPS. In Proceedings of the 10th Portuguese Conference on Artificial Intelligence (EPIA'01). Lecture Notes in Artificial Intelligence, vol. 2258. Springer-Verlag, New York, 261--275.]]

Digital Library

[25]

Leite, J. 2002. Evolving knowledge bases---Specification and semantics. Ph.D. dissertation, Universidade Nova de Lisboa, Lisbon, Portugal.]]

[26]

Leite, J. 2003. Evolving Knowledge Bases. IOS Press.]]

[27]

Lin, F. 2002. Reducing strong equivalence of logic programs to entailment in classical propositional logic. In Proceedings of the 8th International Conference on Principles of Knowledge Representation and Reasoning (KR'02). Morgan-Kaufmann, San Francisco, Calif., 170--176.]]

[28]

Lobo, J., Bhatia, R., and Naqvi, S. 1999. A policy description language. In Proceedings of the 16th National Conference on Artificial Intelligence and 11th Conference on Innovative Applications of Artificial Intelligence (AAAI / IAAI'99). AAAI Press / MIT Press, 291--298.]]

Digital Library

[29]

Marek, V. and Truszczyński, M. 1994. Revision specifications by means of programs. In Proceedings of the 4th European Workshop on Logics in Artificial Intelligence (JELIA'94), C. MacNish, D. Pearce, and L. Pereira, Eds. Lecture Notes in Artificial Intelligence, vol. 838. Springer-Verlag, New York, 122--136.]]

Digital Library

[30]

Marek, V. and Truszczyński, M. 1998. Revision programming. Theoret. Comput. Sci. 190, 2, 241--277.]]

Digital Library

[31]

McMillan, K. 1993. Symbolic Model Checking: An Approach to the State Explosion Problem. Kluwer Academic.]]

Digital Library

[32]

Pearce, D., Tompits, H., and Woltran, S. 2001. Encodings for equilibrium logic and logic programs with nested expressions. In Proceedings of the 10th Portuguese Conference on Artificial Intelligence (EPIA'01). Lecture Notes in Artificial Intelligence, vol. 2258. Springer-Verlag, New York, 306--320.]]

Digital Library

[33]

Pereira, L. and Alferes, J. 1992. Well-founded semantics for logic programs with explicit negation. In Proceedings of the 10th European Conference on Artificial Intelligence (ECAI'92). Wiley, New York., 102--106.]]

Digital Library

[34]

Sistla, A. P. and Wolfson, O. 1995. Temporal conditions and integrity constraints in active database systems. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD 1995). ACM, New York, 269--280.]]

Digital Library

[35]

Son, T. and Lobo, J. 2001. Reasoning about policies using logic programs. In Proceedings of the AAAI 2001 Spring Symposium on Answer Set Programming: Towards Efficient and Scalable Knowledge Representation and Reasoning, A. Provetti and T. C. Son, Eds. AAAI Press, 210--216.]]

[36]

Winslett, M. 1990. Updating Logical Databases. Cambridge University Press, Cambridge, Mass.]]

Digital Library

[37]

Wooldridge, M. 2000a. Reasoning about Rational Agents. MIT Press, Cambridge, Mass.]]

[38]

Wooldridge, M. 2000b. The computational complexity of agent design problem. In Proceedings of the ICMAS 2000. IEEE, Computer Society Press, Los Alamitos, Calif.]]

Digital Library

[39]

Zhang, Y. and Foo, N. 1997. Answer sets for prioritized logic programs. In Proceedings of the Int. Logic Programming Symposium. MIT Press, 69--83.]]

Digital Library

[40]

Zhang, Y. and Foo, N. 1998. Updating logic programs. In Proceedings of the 13th European Conference on Artificial Intelligence (ECAI'98), H. Prade, Ed. Wiley, 403--407.]]

Cited By

Alferes JGabaldon ALeite J(2011)Evolving logic programs with temporal operatorsLogic programming, knowledge representation, and nonmonotonic reasoning10.5555/2001078.2001093(193-212)Online publication date: 1-Jan-2011
https://dl.acm.org/doi/10.5555/2001078.2001093
Alferes JGabaldon ALeite J(2011)Evolving Logic Programs with Temporal OperatorsLogic Programming, Knowledge Representation, and Nonmonotonic Reasoning10.1007/978-3-642-20832-4_14(193-212)Online publication date: 2011
https://doi.org/10.1007/978-3-642-20832-4_14
Alferes JGabaldon ALeite J(2009)A Logic Programming System for Evolving Programs with Temporal OperatorsProceedings of the 14th Portuguese Conference on Artificial Intelligence: Progress in Artificial Intelligence10.1007/978-3-642-04686-5_9(101-112)Online publication date: 7-Oct-2009
https://dl.acm.org/doi/10.1007/978-3-642-04686-5_9
Show More Cited By

Index Terms

Reasoning about evolving nonmonotonic knowledge bases
1. Computing methodologies
  1. Artificial intelligence
    1. Knowledge representation and reasoning
      1. Logic programming and answer set programming
      2. Nonmonotonic, default reasoning and belief revision
2. Theory of computation
  1. Design and analysis of algorithms
  2. Logic
    1. Constraint and logic programming
    2. Modal and temporal logics

Recommendations

Reasoning about Minimal Knowledge in Nonmonotonic Modal Logics

We study the problem of embedding Halpern and Moses‘s modal logic of minimal knowledge states into two families of modal formalism for nonmonotonic reasoning, McDermott and Doyle‘s nonmonotonic modal logics and ground nonmonotonic modal logics. First, we ...
Reasoning about Evolving Nonmonotonic Knowledge Bases
LPAR '01: Proceedings of the Artificial Intelligence on Logic for Programming

Recently, several approaches to updating knowledge bases modeled as extended logic programs (ELPs) have been introduced, ranging from basic methods to incorporate (sequences of) sets of rules into a logic program, to more elaborate methods which use an ...
Towards First-Order Nonmonotonic Reasoning
LPNMR '99: Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning

We investigate the problem of reasoning in nonmonotonic extensions of first-order logic. In particular, we study reasoning in first-order MKNF, the modal logic of minimal knowledge and negation as failure introduced by Lifschitz. MKNF can be considered ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Computational Logic

ACM Transactions on Computational Logic Volume 6, Issue 2

April 2005

278 pages

ISSN:1529-3785

EISSN:1557-945X

DOI:10.1145/1055686

Issue’s Table of Contents

Copyright © 2005 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 April 2005

Published in TOCL Volume 6, Issue 2

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
621
Total Downloads

Downloads (Last 12 months)3
Downloads (Last 6 weeks)0

Reflects downloads up to 31 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Alferes JGabaldon ALeite J(2011)Evolving logic programs with temporal operatorsLogic programming, knowledge representation, and nonmonotonic reasoning10.5555/2001078.2001093(193-212)Online publication date: 1-Jan-2011
https://dl.acm.org/doi/10.5555/2001078.2001093
Alferes JGabaldon ALeite J(2011)Evolving Logic Programs with Temporal OperatorsLogic Programming, Knowledge Representation, and Nonmonotonic Reasoning10.1007/978-3-642-20832-4_14(193-212)Online publication date: 2011
https://doi.org/10.1007/978-3-642-20832-4_14
Alferes JGabaldon ALeite J(2009)A Logic Programming System for Evolving Programs with Temporal OperatorsProceedings of the 14th Portuguese Conference on Artificial Intelligence: Progress in Artificial Intelligence10.1007/978-3-642-04686-5_9(101-112)Online publication date: 7-Oct-2009
https://dl.acm.org/doi/10.1007/978-3-642-04686-5_9
Alferes JGabaldon ALeite J(2008)Evolving Logic Programming Based Agents with Temporal OperatorsProceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 0210.1109/WIIAT.2008.123(238-244)Online publication date: 9-Dec-2008
https://dl.acm.org/doi/10.1109/WIIAT.2008.123
Guadarrama JDix JGalindo M(2006)Update Sequences in Generalised Answer Set Programming Based on Structural PropertiesProceedings of the Fifth Mexican International Conference on Artificial Intelligence10.1109/MICAI.2006.48(32-41)Online publication date: 13-Nov-2006
https://dl.acm.org/doi/10.1109/MICAI.2006.48
Zhang YFoo N(2006)Solving logic program conflict through strong and weak forgettingsArtificial Intelligence10.1016/j.artint.2006.02.002170:8-9(739-778)Online publication date: Jun-2006
https://doi.org/10.1016/j.artint.2006.02.002
Zhang YFoo N(2005)A unified framework for representing logic program updatesProceedings of the 20th national conference on Artificial intelligence - Volume 210.5555/1619410.1619446(707-712)Online publication date: 9-Jul-2005
https://dl.acm.org/doi/10.5555/1619410.1619446

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Issue’s Table of Contents