Finite model search for equational theories (FMSET)

1998 ◽  
pp. 84-93
Author(s):  
Belaid Benhamou ◽  
Laurent Henocque
Keyword(s):  
Finite Model ◽  
Equational Theories ◽  
Model Search

A Hybrid Method for Finite Model Search in Equational Theories

1999 ◽  
Vol 39 (1,2) ◽  
pp. 21-38 ◽  
Author(s):  
Belaid Benhamou ◽  
Laurent Henocque
Keyword(s):  
Hybrid Method ◽  
Finite Model ◽  
Equational Theories ◽  
Model Search

Predicting and Detecting Symmetries in FOL Finite Model Search

2006 ◽  
Vol 36 (3) ◽  
pp. 177-212 ◽  
Author(s):  
Gilles Audemard ◽  
Belaïd Benhamou ◽  
Laurent Henocque
Keyword(s):  
Finite Model ◽  
Model Search

The finite model property for various fragments of linear logic

1997 ◽  
Vol 62 (4) ◽  
pp. 1202-1208 ◽  
Author(s):  
Yves Lafont
Keyword(s):  
Classical Logic ◽  
Linear Logic ◽  
Boolean Model ◽  
Finite Model ◽  
Model Property ◽  
Boolean Models ◽  
Finite Model Property ◽  
First Order ◽  
Proof Search ◽  
Model Search

To show that a formula A is not provable in propositional classical logic, it suffices to exhibit a finite boolean model which does not satisfy A. A similar property holds in the intuitionistic case, with Kripke models instead of boolean models (see for instance [11]). One says that the propositional classical logic and the propositional intuitionistic logic satisfy a finite model property. In particular, they are decidable: there is a semi-algorithm for provability (proof search) and a semi-algorithm for non provability (model search). For that reason, a logic which is undecidable, such as first order logic, cannot satisfy a finite model property.The case of linear logic is more complicated. The full propositional fragment LL has a complete semantics in terms of phase spaces [2, 3], but it is undecidable [9]. The multiplicative additive fragment MALL is decidable, in fact PSPACE-complete [9], but the decidability of the multiplicative exponential fragment MELL is still an open problem. For affine logic, that is, linear logic with weakening, the situation is somewhat better: the full propositional fragment LLW is decidable [5].Here, we show that the finite phase semantics is complete for MALL and for LLW, but not for MELL. In particular, this gives a new proof of the decidability of LLW. The noncommutative case is mentioned, but not handled in detail.

Two Techniques to Improve Finite Model Search

2000 ◽  
pp. 302-308 ◽  
Author(s):  
Gilles Audemard ◽  
Belaid Benhamou ◽  
Laurent Henocque
Keyword(s):  
Finite Model ◽  
Model Search

Finite Model Theory

1995 ◽  
Author(s):  
Heinz-Dieter Ebbinghaus ◽  
Jörg Flum
Keyword(s):  
Model Theory ◽  
Finite Model ◽  
Finite Model Theory

Pembelajaran Matematika dengan Model Search, Solve, Create and Share (SSCS) di MAN 1 Muara Labuh

2017 ◽  
Vol 1 (2) ◽  
pp. 200-210
Author(s):  
Rivdya Eliza ◽  
Fitri Aulia
Keyword(s):  
Problem Solving ◽  
Hypothesis Test ◽  
Mathematical Problem ◽  
Learning Model ◽  
Learning Activity ◽  
Control Group ◽  
Learning Models ◽  
Problem Solving Skills ◽  
Model Search ◽  
Quasi Experimental

The purpose of this research are: 1) to know the learning activity of learners mathematics which is taught by Search, Solve, Create, and Share (SSCS), and 2) model to know the ability of problem solving of mathematics learners who taught by SSCS learning model in the class XI MIA MAN 1 Muara Labuh academic year 2016/2017. This research belongs to a kind of quasi-experimental research with randomized control group only design. In this study design, a group of subjects taken from a particular population were randomly assigned into two groups, the experimental group and the control group. After analyzing the data, it is known that the learning activity of the students after applying the SSCS learning model has improved towards the better from the first meeting to the fifth meeting, ie 35%, 45%, 55%, 68%, 77%. Based on the hypothesis test obtained ttable = 1.645 and tcount = 2.598 so obtained (2.598> 1.645) at 95% confidence interval. Because tcount > ttable then hypothesis in this research accepted. Thus, students 'math-problem-solving skills taught by SSCS learning models are higher than the students' uneducated mathematical problem-solving skills with SSCS learning modelsKeywords: Problem solving abilities, search, solve, sreate and share (SSCS) learning models

scholarly journals A spatio-temporal specification language and its completeness & decidability

2020 ◽  
Vol 9 (1) ◽  
Author(s):  
Tengfei Li ◽  
Jing Liu ◽  
Haiying Sun ◽  
Xiang Chen ◽  
Lipeng Zhang ◽  
...  
Keyword(s):  
Intelligent Transportation System ◽  
Cyber Physical Systems ◽  
Specification Language ◽  
Finite Model ◽  
Critical Systems ◽  
Physical Systems ◽  
Spatial Objects ◽  
Temporal Properties ◽  
Spatio Temporal ◽  
Temporal Specification

AbstractIn the past few years, significant progress has been made on spatio-temporal cyber-physical systems in achieving spatio-temporal properties on several long-standing tasks. With the broader specification of spatio-temporal properties on various applications, the concerns over their spatio-temporal logics have been raised in public, especially after the widely reported safety-critical systems involving self-driving cars, intelligent transportation system, image processing. In this paper, we present a spatio-temporal specification language, STSL PC, by combining Signal Temporal Logic (STL) with a spatial logic S4 u, to characterize spatio-temporal dynamic behaviors of cyber-physical systems. This language is highly expressive: it allows the description of quantitative signals, by expressing spatio-temporal traces over real valued signals in dense time, and Boolean signals, by constraining values of spatial objects across threshold predicates. STSL PC combines the power of temporal modalities and spatial operators, and enjoys important properties such as finite model property. We provide a Hilbert-style axiomatization for the proposed STSL PC and prove the soundness and completeness by the spatio-temporal extension of maximal consistent set and canonical model. Further, we demonstrate the decidability of STSL PC and analyze the complexity of STSL PC. Besides, we generalize STSL to the evolution of spatial objects over time, called STSL OC, and provide the proof of its axiomatization system and decidability.

Sign in / Sign up

Export Citation Format

Share Document