Skip to main content
SpringerLink
Log in

A Constraint Solver for Equations over Sequences and Contexts

  • Conference paper
  • First Online:
Advanced Computational Methods for Knowledge Engineering

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 453))

  • 530 Accesses

Abstract

In this paper we propose a solving algorithm for equational constraints over unranked terms, contexts, and sequences. Unranked terms are constructed over function symbols which do not have fixed arity. For some function symbols, the order of the arguments matters (ordered symbols). For some others, this order is irrelevant (unordered symbols). Contexts are unranked terms with a single occurrence of hole. Sequences consist of unranked terms and contexts. Term variables stand for single unranked terms, sequence variables for sequences, context variables for contexts, and function variables for function symbols. We design an terminated and incomplete constraint solving algorithm, and indicate a fragment for which the algorithm is complete.

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

Access this chapter

Log in via an institution

Institutional subscriptions

References

  1. Bojanczyk, M., Walukiewicz, I.: Forest algebras. In: Flum, J., Grädel, E., Wilke, T. (eds.) Logic and Automata. Texts in Logic and Games, vol. 2, pp. 107–132. Amsterdam University Press (2008)

    Google Scholar 

  2. Boley, H.: A Tight, Practical Integration of Relations and Functions. Lecture Notes in Computer Science, vol. 1712. Springer, Berlin (1999)

    Google Scholar 

  3. Chasseur, E., Deville, Y.: Logic program schemas, constraints, and semi-unification. In: Fuchs, N.E. (ed.) LOPSTR. Lecture Notes in Computer Science, vol. 1463, pp. 69–89. Springer, Berlin (1997)

    Chapter  Google Scholar 

  4. Comon, H.: Completion of rewrite systems with membership constraints. Part II: constraint solving. J. Symb. Comput. 25(4), 421–453 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  5. Dovier, A., Piazza, C., Pontelli, E., Rossi, G.: Sets and constraint logic programming. ACM Trans. Program. Lang. Syst. 22(5), 861–931 (2000)

    Article  Google Scholar 

  6. Dundua, B.: Programming with Sequence and Context Variables:Foundations and Applications. Ph.D. thesis, Universidade do Porto (2014)

    Google Scholar 

  7. Dundua, B., Florido, M., Kutsia, T., Marin, M.: Constraint logic programming for hedges: A semantic reconstruction. In: Codish, M., Sumii, E. (eds.) Functional and Logic Programming—12th International Symposium, FLOPS 2014, Kanazawa, Japan, June 4–6, 2014. Proceedings. Lecture Notes in Computer Science, vol. 8475, pp. 285–301. Springer, Switzerland (2014)

    Chapter  MATH  Google Scholar 

  8. Dundua, B., Kutsia, T., Marin, M.: Strategies in P\(\rho \)log. In: Fernández, M. (ed.) WRS, EPTCS, vol. 15, pp. 32–43 (2009)

    Google Scholar 

  9. ISO/IEC. Information technology—Common Logic (CL): a framework for a family of logic-based languages. International Standard ISO/IEC 24707 (2007). http://standards.iso.org/ittf/PubliclyAvailableStandards/c039175_ISO_IEC_24707_2007(E).zip

  10. Jacquemard, F., Rusinowitch, M.: Closure of hedge-automata languages by hedge rewriting. In: Voronkov, A. (ed.) RTA. LNCS, vol. 5117, pp. 157–171. Springer, Berlin (2008)

    Google Scholar 

  11. Kutsia, T.: Solving and Proving in Equational Theories with Sequence Variables and Flexible Arity Symbols. RISC report Series 02–09, Research Institute for Symbolic Computation (RISC), University of Linz, Schloss Hagenberg, 4232 Hagenberg, Austria, May 2002. Ph.D. thesis

    Google Scholar 

  12. Kutsia, T.: Theorem proving with sequence variables and flexible arity symbols. In: Baaz, M., Voronkov, A. (eds.) LPAR. Lecture Notes in Computer Science, vol. 2514, pp. 278–291. Springer, Berlin (2002)

    Chapter  MATH  Google Scholar 

  13. Kutsia, T.: Solving equations with sequence variables and sequence functions. J. Symb. Comput. 42(3), 352–388 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  14. Kutsia, T., Buchberger, B.: Predicate logic with sequence variables and sequence function symbols. In: Asperti, A., Bancerek, G., Trybulec, A. (eds.) MKM. Lecture Notes in Computer Science, vol. 3119, pp. 205–219. Springer, Berlin (2004)

    Google Scholar 

  15. Kutsia, T., Marin, M.: Matching with regular constraints. In: Sutcliffe, G., Voronkov, A. (eds.) LPAR. Lecture Notes in Computer Science, vol. 3835, pp. 215–229. Springer, Berlin (2005)

    Chapter  Google Scholar 

  16. Kutsia, T., Marin, M.: Solving, reasoning, and programming in common logic. In: SYNASC, pp. 119–126. IEEE Computer Society (2012)

    Google Scholar 

  17. Levy, J.: Linear second-order unification. In: Ganzinger, H. (ed.) RTA. Lecture Notes in Computer Science, vol. 1103, pp. 332–346. Springer, Berlin (1996)

    Chapter  Google Scholar 

  18. Libkin, L.: Logics for unranked trees: an overview. Logical Methods Comput. Sci. 2(3) (2006)

    Google Scholar 

  19. Makanin, G.S.: The problem of solvability of equations in a free semigroup. Math. USSR-Sb. 32(2), 129, 147–236 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  20. Menzel, C.: Knowledge representation, the world wide web, and the evolution of logic. Synthese 182(2), 269–295 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  21. Schmidt-Schauß, M., Stuber, J.: The complexity of linear and stratified context matching problems. Theor. Comput. Syst. 37(6), 717–740 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  22. Wand, M.: Complete type inference for simple objects. In: LICS, pp. 37–44. IEEE Computer Society (1987)

    Google Scholar 

  23. Wolfram, S.: The Mathematica Book. Wolfram-Media, 5th edn. (2003)

    Google Scholar 

Download references

Acknowledgments

Besik Dundua has been partially supported by the Shota Rustaveli National Science Foundation under the grants FR/325/4-120/14, YS/10/11-811/15 and YS15_2.1.2_70.

Author information

Authors and Affiliations

  1. Vekua Institute of Applied Mathematics, Tbilisi State University, 0183, Tbilisi, Georgia

    Mariam Beriashvili & Besik Dundua

Authors
  1. Mariam Beriashvili
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Besik Dundua
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Besik Dundua .

Editor information

Editors and Affiliations

  1. International Institute for Applied Systems Analysis (IIASA), Laxenburg, Austria

    Thanh Binh Nguyen

  2. Department of Networked Systems and Services, Budapest University of Technology and Economics, Budapest, Hungary

    Tien van Do

  3. Laboratory of Theoretical and Applied Computer Science (LITA), UFR MIM, University of Lorraine, Ile du Saulcy, Metz, France

    Hoai An Le Thi

  4. Institute of Informatics, Wrocław University of Technology, Wrocław, Poland

    Ngoc Thanh Nguyen

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Beriashvili, M., Dundua, B. (2016). A Constraint Solver for Equations over Sequences and Contexts. In: Nguyen, T.B., van Do, T., An Le Thi, H., Nguyen, N.T. (eds) Advanced Computational Methods for Knowledge Engineering. Advances in Intelligent Systems and Computing, vol 453. Springer, Cham. https://doi.org/10.1007/978-3-319-38884-7_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-38884-7_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-38883-0

  • Online ISBN: 978-3-319-38884-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation