9 Hits in 2.1 sec

Finite model search for equational theories (FMSET) [chapter]

Belaid Benhamou, Laurent Henocque
1998 Lecture Notes in Computer Science  
In this paper, we introduce a system called FMSET which generates finite structures representing models of equational theories.  ...  Finite model and counter model generation is a potential alternative in automated theorem proving.  ...  In this paper, we present a new finite model generator, the system FMSET (Finite Model Search for Equational Theories).  ... 
doi:10.1007/bfb0055904 fatcat:lzknwdppz5gkzpx6t6hdnsurwi

Page 5793 of Mathematical Reviews Vol. , Issue 2000h [page]

2000 Mathematical Reviews  
In this paper, we introduce a system called FMSET which generates finite structures representing models of equational theories.  ...  {For the entire collection see MR 2000g:00072. } 2000h:68247 68W30 Benhamou, Belaid (F-PROV-LI; Marseille) ; Henocque, Laurent (F-PROV-LI; Marseille) A hybrid method for finite model search in equational  ... 

Two Techniques to Improve Finite Model Search [chapter]

Gilles Audemard, Belaid Benhamou, Laurent Henocque
2000 Lecture Notes in Computer Science  
This article introduces two techniques to improve the propagation efficiency of CSP based finite model generation methods.  ...  VESEM seems to provide the basis for a general algorithm for finite model search of first order theories.  ...  SEM's finite model search algorithm is described in figure 1 .  ... 
doi:10.1007/10721959_24 fatcat:3jwwnr2mhzebpdmfw6smkyopqq

Page 7881 of Mathematical Reviews Vol. , Issue 99k [page]

1999 Mathematical Reviews  
Henocque, Finite model search for equational theories (FMSET) (84-93); P.  ...  Yakovlev], Unfolding and finite prefix for nets with read arcs (501 516); Dietrich Kuske, Asynchronous cellular automata and asyn- chronous automata for pomsets (517-532); Philippe Darondeau, Deriving  ... 

Reasoning by Symmetry and Function Ordering in Finite Model Generation [chapter]

Gilles Audemard, Belaid Benhamou
2002 Lecture Notes in Computer Science  
Finite model search for first-order logic theories is complementary to theorem proving.  ...  We study in this paper both an ordering strategy that selects the next terms to be interpreted and a more general notion of symmetry for finite model search in first-order logic.  ...  The same technique is used by Masayuki Fujita et al. in [6] to search for finite models of quasigroup problems.  ... 
doi:10.1007/3-540-45620-1_19 fatcat:z3ewewf37vgnjjqpior7eed5cy

Foundations of Nominal Techniques: Logic and Semantics of Variables in Abstract Syntax

Murdoch J. Gabbay
2011 Bulletin of Symbolic Logic  
None of these models is perfect. In every case for the models above, problems arise when trying to use them as a basis for a fully formal mechanical treatment of formal language.  ...  What makes this model really interesting is that it gives names distinctive properties which can be related to useful logic and programming principles for formal syntax.  ...  We write FMSet and not Set so as to account for atoms.  ... 
doi:10.2178/bsl/1305810911 fatcat:upt3o65msfd6zeeozxoargulmq

Boosting Isomorphic Model Filtering with Invariants [article]

João Araújo, Choiwah Chow, Mikoláš Janota
2022 arXiv   pre-print
The enumeration of finite models is very important to the working discrete mathematician (algebra, graph theory, etc) and hence the search for effective methods to do this task is a critical goal in discrete  ...  This approach is integrated into Mace4 (the most popular tool among mathematicians) where it shows tremendous speed-ups for a large variety of algebraic structures.  ...  For these algebras, a finite model finder, such as Mace4 [22] , SEM [30] , and FALCON [29] , FMSET [7] , etc., can work on finding all their models.  ... 
arXiv:2201.10516v1 fatcat:ucecule5szamvmmmlf6n4w7gsq

Abstract effects and proof-relevant logical relations

Nick Benton, Martin Hofmann, Vivek Nigam
2014 Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages - POPL '14  
, such as the reorganisation of a search tree or lazy initialisation, can count as 'pure' or 'read only'.  ...  We give a denotational semantics for a region-based effect system that supports type abstraction in the sense that only externally visible effects need to be tracked: non-observable internal modifications  ...  Acknowledgments We thank Lennart Beringer and Andrew Kennedy for fruitful discussions. Nigam was supported by CAPES / CNPq and DAAD.  ... 
doi:10.1145/2535838.2535869 dblp:conf/popl/Benton0N14 fatcat:qxxlg2mvfzfbjhvl5pqgci3dra

Assertion level proof planning with compiled strategies [article]

Dominik Dietrich, Universität Des Saarlandes, Universität Des Saarlandes
Request to the Publisher for permission should be addressed to  ...  Similarly, counter-models can be generated for other theories, such as the theory of binary relations.  ...  Integration of Model Generators A variety of tools has been developed for finding finite models of first order logic (FOL) formulas, such as Paradox [CS03] , Finder [Sla94] , Sem [ZZ95] , Mace4 [McC03  ... 
doi:10.22028/d291-26394 fatcat:ubhz423ftrcn7ez35xgx3ggczy