Skip to main content

Finding Finite Herbrand Models

  • Conference paper
  • 722 Accesses

Part of the Lecture Notes in Computer Science book series (LNTCS,volume 7180)

Abstract

We show that finding finite Herbrand models for a restricted class of first-order clauses is ExpTime-complete. A Herbrand model is called finite if it interprets all predicates by finite subsets of the Herbrand universe. The restricted class of clauses consists of anti-Horn clauses with monadic predicates and terms constructed over unary function symbols and constants. The decision procedure can be used as a new goal-oriented algorithm to solve linear language equations and unification problems in the description logic \(\mathcal{FL}_0\). The new algorithm has only worst-case exponential runtime, in contrast to the previous one which was even best-case exponential.

Keywords

  • Decision Procedure
  • Description Logic
  • Replacement Sequence
  • Tree Automaton
  • Unary Predicate

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (Canada)
  • 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baader, F., Narendran, P.: Unification of concept terms in description logics. J. Symb. Comput. 31(3), 277–305 (2001)

    CrossRef  MathSciNet  MATH  Google Scholar 

  2. Baumgartner, P., Fuchs, A., de Nivelle, H., Tinelli, C.: Computing finite models by reduction to function-free clause logic. J. Appl. Log. 7(1), 58–74 (2009)

    CrossRef  MathSciNet  MATH  Google Scholar 

  3. Birget, J.: State-complexity of finite-state devices, state compressibility and incompressibility. Math. Syst. Theory 26(3), 237–269 (1993)

    CrossRef  MathSciNet  MATH  Google Scholar 

  4. Borgwardt, S., Morawska, B.: Finding finite Herbrand models. LTCS-Report 11-04, TU Dresden (2011), http://lat.inf.tu-dresden.de/research/reports.html

  5. Chandra, A.K., Kozen, D.C., Stockmeyer, L.J.: Alternation. J. ACM 28(1), 114–133 (1981)

    CrossRef  MathSciNet  MATH  Google Scholar 

  6. Comon, H., Dauchet, M., Gilleron, R., Löding, C., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (2007), http://www.grappa.univ-lille3.fr/tata

  7. Dreben, B., Goldfarb, W.D.: The Decision Problem: Solvable Classes of Quantificational Formulas. Addison-Wesley (1979)

    Google Scholar 

  8. Joyner Jr., W.H.: Resolution strategies as decision procedures. J. ACM 23(3), 398–417 (1976)

    CrossRef  MathSciNet  MATH  Google Scholar 

  9. Ladner, R.E., Lipton, R.J., Stockmeyer, L.J.: Alternating pushdown and stack automata. SIAM J. Comput. 13(1), 135–155 (1984)

    CrossRef  MathSciNet  MATH  Google Scholar 

  10. Leitsch, A.: The Resolution Calculus. Springer, Heidelberg (1997)

    CrossRef  MATH  Google Scholar 

  11. Peltier, N.: Model building with ordered resolution: Extracting models from saturated clause sets. J. Symb. Comput. 36(1-2), 5–48 (2003)

    CrossRef  MathSciNet  MATH  Google Scholar 

  12. Petri, C.A.: Kommunikation mit Automaten. Ph.D. thesis, Uni Bonn (1962)

    Google Scholar 

  13. Reisig, W.: Petri Nets: An Introduction. Springer, Heidelberg (1985)

    MATH  Google Scholar 

  14. Slutzki, G.: Alternating tree automata. Theor. Comput. Sci. 41, 305–318 (1985)

    CrossRef  MathSciNet  MATH  Google Scholar 

  15. Vardi, M.Y., Wolper, P.: Automata theoretic techniques for modal logics of programs (extended abstract). In: Proc. STOC 1984, pp. 446–456. ACM (1984)

    Google Scholar 

  16. Zhang, J.: Constructing finite algebras with FALCON. J. Autom. Reasoning 17, 1–22 (1996)

    CrossRef  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Borgwardt, S., Morawska, B. (2012). Finding Finite Herbrand Models. In: Bjørner, N., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2012. Lecture Notes in Computer Science, vol 7180. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28717-6_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-28717-6_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-28716-9

  • Online ISBN: 978-3-642-28717-6

  • eBook Packages: Computer ScienceComputer Science (R0)