skip to main content
10.1145/2427376.2427384acmconferencesArticle/Chapter ViewAbstractPublication PagesmodevvaConference Proceedingsconference-collections
research-article

Comparing the effectiveness of reasoning formalisms for partial models

Published:01 October 2012Publication History

ABSTRACT

Uncertainty is pervasive in Model-based Software Engineering. In previous work, we have proposed partial models as a way to explicate uncertainty during modeling. Using partial models, modelers can perform certain forms of reasoning, like checking properties, without the having to prematurely resolve uncertainty. In this paper, we present a strategy for encoding partial models into different reasoning formalisms and conduct an empirical study aimed to compare the effectiveness of these formalisms for checking properties of partial models.

References

  1. C. Baral. Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, Cambridge, UK, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. C. Barrett, A. Stump, and C. Tinelli. The SMT-LIB Standard: Version 2.0. In Proc. of SMT'10, 2010.Google ScholarGoogle Scholar
  3. L. De Moura and N. Bjørner. Satisfiability Modulo Theories: Introduction and Applications. Commun. ACM, 54(9):69--77, Sept. 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. N. Eén and N. Sörensson. An Extensible SAT-Solver. In Theory and Applications of Satisfiability Testing, pages 333--336. Springer, 2004.Google ScholarGoogle Scholar
  5. M. Famelis, S. Ben-David, M. Chechik, and R. Salay. Partial Models: A Position Paper. In Proc. of MoDeVVa'11, pages 1--6, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. M. Famelis, M. Chechik, and R. Salay. Partial Models: Towards Modeling and Reasoning with Uncertainty. In Proc. of ICSE'12, June 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. M. Famelis, M. Chechik, and R. Salay. The Semantics of Partial Model Transformations. In Proc. of MiSE'12, June 2012.Google ScholarGoogle ScholarCross RefCross Ref
  8. M. Gebser, R. Kaminski, A. König, and T. Schaub. Advances in gringo Series 3. In Proc. of LPNMR'11, volume 6645 of LNCS, pages 345--351, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. M. Gebser, B. Kaufmann, A. Neumann, and T. Schaub. Conflict-Driven Answer Set Solving. In Proc. of IJCAI'07, pages 386--392, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. J. Gorzny, R. Salay, and M. Chechik. Change Propagation Due to Uncertainty Change, August 2012. submitted.Google ScholarGoogle Scholar
  11. D. Jackson. Software Abstractions: Logic, Language, and Analysis. MIT Press, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. V. W. Marek and M. Truszczynski. Stable Models and an Alternative Logic Programming Paradigm. CoRR, cs.LO/9809032, 1998.Google ScholarGoogle Scholar
  13. N. Nethercote, P. Stuckey, R. Becket, S. Brand, G. Duck, and G. Tack. Minizinc: Towards a Standard CP Modelling Language. In Proc. of CP'07, pages 529--543. Springer, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. R. Pohl, K. Lauenroth, and K. Pohl. A Performance Comparison of Contemporary Algorithmic Approaches for Automated Analysis Operations on Feature Models. In Proc. of ASE'11, pages 313--322. IEEE Computer Society, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. R. Salay, M. Chechik, and J. Gorzny. Towards a Methodology for Verifying Partial Model Refinements. In Proc. of VOLT'12, April 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. R. Salay, M. Chechik, and J. Horkoff. Managing Requirements Uncertainty with Partial Models. In Proc. of RE'12, 2012. to appear. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. R. Salay, M. Famelis, and M. Chechik. Language Independent Refinement using Partial Modeling. In Proc. of FASE'12, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. A. Silberschatz, H. Korth, and S. Sudarshan. Database System Concepts. McGraw-Hill, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. E. Tsang. Foundations of constraint satisfaction. Academic Press, London San Diego, 1993.Google ScholarGoogle Scholar

Index Terms

  1. Comparing the effectiveness of reasoning formalisms for partial models

    Recommendations

    Comments

    Login options

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

    Sign in
    • Published in

      cover image ACM Conferences
      MoDeVVa '12: Proceedings of the Workshop on Model-Driven Engineering, Verification and Validation
      October 2012
      51 pages
      ISBN:9781450318013
      DOI:10.1145/2427376

      Copyright © 2012 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: 1 October 2012

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader