Skip to main content
SpringerLink
Log in

Model Representation via Contexts and Implicit Generalizations

  • Conference paper
Automated Deduction – CADE-20 (CADE 2005)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3632))

Included in the following conference series:

Abstract

Some results on expressibility and complexity issues in model representation are presented. In particular, the relation between so-called ‘contexts’ as recently introduced in [4] for the model evolution calculus and the more traditional ‘disjunctions of implicit generalizations’ (DIGs) [21] is clarified: contexts are as expressible as DIGs, but DIGs may represent the same model exponentially more succinctly. The clause evaluation problem and the equivalence problem for DIGs and contexts, respectively, are all shown to be coNP-complete.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baumgartner, P., Fuchs, A., Tinelli, C.: Darwin: A theorem prover for the model evolution calculus. In: Proceedings of ESFOR 2004, Elsevier, Amsterdam (2004)

    Google Scholar 

  2. Baumgartner, P., Furbach, U., Gross-Hardt, M., Sinner, A.: Living Book – Deduction, Slicing, and Interaction. Journal of Automated Reasoning 32(3), 259–286 (2004)

    Article  Google Scholar 

  3. Baumgartner, P., Gross-Hardt, M., Sinner, A.: Living Book – Deduction, Slicing, and Interaction. Fachberichte Informatik, Universität Koblenz Landau, vol. 2 (2003)

    Google Scholar 

  4. Baumgartner, P., Tinelli, C.: The model evolution calculus. In: Baader, F. (ed.) CADE 2003. LNCS (LNAI), vol. 2741, pp. 350–364. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  5. Baumgartner, P., Tinelli, C.: The model evolution calculus. Fachberichte Informatik, Universität Koblenz Landau. vol.1 (2003) In: Extended Version of [4] (2003)

    Google Scholar 

  6. Billon, J.-P.: The disconnection method – a confluent integration of unification in the analytic framework. In: Miglioli, P., Moscato, U., Ornaghi, M., Mundici, D. (eds.) TABLEAUX 1996. LNCS, vol. 1071, pp. 110–126. Springer, Heidelberg (1996)

    Google Scholar 

  7. Bürckert, H.-J.: Solving disequations in equational theories. In: Lusk, E.‘., Overbeek, R. (eds.) CADE 1988. LNCS, vol. 310, pp. 517–526. Springer, Heidelberg (1988)

    Chapter  Google Scholar 

  8. Caferra, R., Leitsch, A., Peltier, N.: Automated Model Building. In: Applied Logic Series, vol. 31, Kluwer Academic Publishers, Dordrecht (2004)

    Google Scholar 

  9. Caferra, R., Peltier, N.: Extending semantic resolution via automated model building: applications. In: Proceedings of IJCAI 1995, pp. 328–334 (1995)

    Google Scholar 

  10. Caferra, R., Zabel, N.: Extending resolution for model construction. In: van Eijck, J. (ed.) JELIA 1990. LNCS, vol. 478, pp. 153–169. Springer, Heidelberg (1991)

    Chapter  Google Scholar 

  11. Comon, H.: Disunification: a survey. In: Computational Logic: Essays in Honor of Alan Robinson, MIT Press, Cambridge (1991)

    Google Scholar 

  12. Eiter, T., Gottlob, G., Veith, H.: Modular logic programming and generalized quantifiers. In: Fuhrbach, U., Dix, J., Nerode, A. (eds.) LPNMR 1997. LNCS, vol. 1265, pp. 290–309. Springer, Heidelberg (1997)

    Google Scholar 

  13. Fermüller, C.G., Leitsch, A.: Model building by resolution. In: Proceedings of CSL 1992. LNCS, vol. 702, pp. 134–148. Springer, Heidelberg (1993)

    Google Scholar 

  14. Fermüller, C.G., Leitsch, A.: Hyperresolution and automated model building. Journal of Logic and Computation 6(2), 173–203 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  15. Gottlob, G., Pichler, R.: Working with ARMs: Complexity results on atomic representations of Herbrand models. Information and Computation 165, 183–207 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  16. Gottlob, G., Marcus, S., Nerode, A., Salzer, G., Subrahmanian, V.S.: A non-ground realization of the stable and well-founded semantics. Theoretical Computer Science 166(1&2), 221–262 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  17. Jouannaud, J.-P., Kounalis, E.: Automatic proofs by induction in theories without constructors. Information and Computation 82(1), 1–33 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  18. Kapur, D., Narendran, P., Rosenkrantz, D., Zhang, H.: Sufficient-completeness, ground-reducibility and their complexity. Acta Informatica 28(4), 311–350 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  19. Kunen, K.: Answer sets and negation as failure. In: Proceedings of ICLP 1987, pp. 219–228. MIT Press, Cambridge (1987)

    Google Scholar 

  20. Lassez, J.-L., Maher, M., Marriott, K.: Elimination of negation in term algebras. In: Tarlecki, A. (ed.) MFCS 1991. LNCS, vol. 520, pp. 1–16. Springer, Heidelberg (1991)

    Google Scholar 

  21. Lassez, J.-L., Marriott, K.: Explicit representation of terms defined by counter examples. Journal of Automated Reasoning 3(3), 301–317 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  22. Letz, R., Stenz, G.: Model Elimination and Connection Tableau Procedures. In: Handbook of Automated Reasoning, June 2001, vol. II, pp. 2015–2114 (2001)

    Google Scholar 

  23. Letz, R., Stenz, G.: Proof and model generation with disconnection tableaux. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS (LNAI), vol. 2250, pp. 142–156. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  24. Letz, R., Stenz, G.: Generalised handling of variables in disconnection tableaux. In: Basin, D., Rusinowitch, M. (eds.) IJCAR 2004. LNCS (LNAI), vol. 3097, pp. 289–306. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  25. Maher, M.: Complete axiomatizations of the algebras of finite, rational and infinite trees. In: Proceedings of LICS 1988, pp. 348–357. IEEE Computer Society, Los Alamitos (1988)

    Google Scholar 

  26. Maher, M., Stuckey, P.: On inductive inference of cyclic structures. Annals of Mathematics and Artificial Intelligence 15(2), 167–208 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  27. Marriott, K.: Finding Explicit Representations for Subsets of the Herbrand Universe. PhD thesis, University of Melbourne, Australia (1988)

    Google Scholar 

  28. Martelli, A., Montanari, U.: An efficient unification algorithm. ACM Transactions on Programming Languages and Systems 4(2), 258–282 (1982)

    Article  MATH  Google Scholar 

  29. Matzinger, R.: Computational representations of models in first-order logic. Technische Universität Wien, Dissertation, Ph.D. thesis (2000)

    Google Scholar 

  30. Pichler, R.: Explicit versus implicit representations of subsets of the Herbrand universe. Theoretical Computer Science 290(1), 1021–1056 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  31. Vorobyov, S.: An improved lower bound for the elementary theories of trees. In: Proceedings of CADE-13. LNCS (LNAI), vol. 690, pp. 316–327. Springer, Heidelberg (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Technische Universität Wien, A-1040, Vienna, Austria

    Christian G. Fermüller & Reinhard Pichler

Authors
  1. Christian G. Fermüller
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Reinhard Pichler
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Technical University of Catalonia, Barcelona

    Robert Nieuwenhuis

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fermüller, C.G., Pichler, R. (2005). Model Representation via Contexts and Implicit Generalizations. In: Nieuwenhuis, R. (eds) Automated Deduction – CADE-20. CADE 2005. Lecture Notes in Computer Science(), vol 3632. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11532231_30

Download citation

  • DOI: https://doi.org/10.1007/11532231_30

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28005-7

  • Online ISBN: 978-3-540-31864-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation