8,803 Hits in 5.9 sec

Modalities for model checking: branching time logic strikes back

E. Allen Emerson, Chin-Laung Lei
1987 Science of Computer Programming  
Acknowledgment We would like to thank the referees for their extremely thorough reading of the previous version of the manuscript which caught several rather subtle technical glitches, and for suggesting  ...  Dijkstra's Austin Tuesday Afternoon Club for helpful criticisms and comments, as well as Graham Gough.  ...  in the paper 'Modalities for model checking: Branching time strikes back'). t This work was supported in part by NSF Grants MCS8302878, DCR8511354.  ... 
doi:10.1016/0167-6423(87)90036-0 fatcat:zzdxnvr46jci3oxqsmjnf657yq

Some model theory for the modal μ-calculus: syntactic characterisations of semantic properties [article]

Gaëlle Fontaine, Yde Venema
2018 arXiv   pre-print
This paper contributes to the theory of the modal μ-calculus by proving some model-theoretic results.  ...  Thus our results can also be seen as a contribution to the model theory of modal automata.  ...  Acknowledgment The authors are deeply indebted to the two referees for many helpful comments on an earlier version of this paper.  ... 
arXiv:1801.05994v1 fatcat:5jcelk3fe5aodm2ulx4ecthlju

Towards Explainable Fact Checking [article]

Isabelle Augenstein
2021 arXiv   pre-print
While this has been known for some time, the issues this raises have been exacerbated by models increasing in size, and by EU legislation requiring models to be used for decision making to provide explanations  ...  At the same time, it is desirable to explain how they arrive at certain decisions, especially if they are to be used for decision making.  ...  LSTMs are able to model discrete time series and possess a ‘memory’ property of the previous time steps, therefore we propose a branch-LSTM model that utilises them to process branches of tweets.  ... 
arXiv:2108.10274v2 fatcat:5s4an6irezcjfmvvhmiaeqarh4

A Unified Approach to Architecture Conformance Checking

Andrea Caracciolo, Mircea Filip Lungu, Oscar Nierstrasz
2015 2015 12th Working IEEE/IFIP Conference on Software Architecture  
Logic Programming: Our approach is related to logic programming in general and modal logic in particular.  ...  The most striking examples are Data structure, signature, dependencies.  ... 
doi:10.1109/wicsa.2015.11 dblp:conf/wicsa/CaraccioloLN15 fatcat:p7645eykmfgc3aopopwwmwplu4

On compliance checking for clausal constraints in annotated process models

Jörg Hoffmann, Ingo Weber, Guido Governatori
2009 Information Systems Frontiers  
compliance checking for more general cases.  ...  Since long waiting times are undesirable, it is important to develop efficient (low-order polynomial time) algorithms that (a) perform exact compliance checking for restricted cases, or (b) perform approximate  ...  The temporal logic formulas are processed using model checking to verify compliance.  ... 
doi:10.1007/s10796-009-9179-7 fatcat:u2byxkh46vbg5f367rvcaghszm

Lexical Integrity, Checking, and the Mirror: A Checking Approach to Syntactic Word Formation

Marcel Den Dikken
2002 Journal of Comparative Germanic Linguistics  
But syntactic word formation, if understood in terms of the checking of features of subparts of words in designated syntactic positions, is readily reconciled with strong lexicalism.  ...  The syntactically complex structure of unhappier and ungrammaticality that underlies the checking approach to syntactic word formation is supported on the basis of evidence from polarity item licensing  ...  F-head, this time Deg.  ... 
doi:10.1023/a:1023644921934 fatcat:moge2jykjzg2vkhauzenfsoudy

Simulation and Statistical Model Checking of Logic-Based Multi-Agent System Models [chapter]

Christian Kroiß
2014 Advances in Intelligent Systems and Computing  
This thesis presents SALMA (Simulation and Analysis of Logic-Based Multi-Agent Models), a new approach for simulation and statistical model checking of multi-agent system models.  ...  Statistical model checking is a relatively new branch of model-based approximative verification methods that help to overcome the well-known scalability problems of exact model checking.  ...  For the system model, SALMA makes use of the situation calculus, an approach for modeling dynamic systems in first order logic that dates back several decades.  ... 
doi:10.1007/978-3-319-07650-8_16 fatcat:i6gatjtoqnew7hgqzd5nji4rhe

Intelligent System for Checking the Authenticity of Goods Based on Blockchain Technology

Oleh Prokipchuk, Lyubomyr Chyrun, Myroslava Bublyk, Valentyna Panasyuk, Viktor Yakimtsov, Roman Kovalchuk
2021 Modern Machine Learning Technologies  
When the buyer scans the secret code, the balance of the interests is transferred back to the manufacturer.  ...  The subject of this bachelor's thesis research is the developed information system for the authenticity of goods based on blockchain technology. Here is how this system works.  ...  At the end of the section, a statistical study of the program's behaviour was performed for further optimization based on dependencies such as time, mining complexity, block size, and processor frequency  ... 
dblp:conf/momlet/ProkipchukCBPYK21 fatcat:7dhnqcx27raitkpuarefozqhhu

Page 4655 of Mathematical Reviews Vol. , Issue 89H [page]

1989 Mathematical Reviews  
Allen (1-TX-C); Lei, Chin-Laung (1-TX-C) Modalities for model checking: branching time logic strikes back. Sci. Comput. Programming 8 (1987), no. 3, 275-306.  ...  We go on to argue that branching time logic is always better than linear time logic for model checking.  ... 

From Philosophical to Industrial Logics [chapter]

Moshe Y. Vardi
2008 Lecture Notes in Computer Science  
for model-checking tools.  ...  This development was enabled by the equally unlikely transformation of the mathematical machinery of automata on infinite words, introduced in the early 1960s for second-order logic, into effective algorithms  ...  Tabakov for proofreading earlier drafts. I'd also like to thank K. Rozier for her help with graphics.  ... 
doi:10.1007/978-3-540-92701-3_7 fatcat:jmuizalywnhflmx46d65gsxita

Temporal patterns and modal structure

J van Benthem
1999 Logic Journal of the IGPL  
back-and-forth clauses for  ...  Given the relative concreteness of its subject matter, temporal logic constructs description languages for independently given temporal models, while modal logic is in the business of constructing models  ...  One striking motivation for this move has been the desire to lower complexity of existing modal or temporal logics.  ... 
doi:10.1093/jigpal/7.1.7 fatcat:cjkmqmzoyvh3zl7lw2s7jzpclu

The master argument and branching time

Lars Gundersen
2003 Logic and Logical Philosophy  
This finding is, furthermore, taken as indicator for the more generel claim that there are principled difficulties involved in construing semantics for combined tense/modal logical systems.  ...  It is furthermore argued that these two axioms are inconsistent in the sense that any tense/modal semantics which incorporates both collapses either modally (fails to distinguish between truth simpliciter  ...  I would like to thank Andrzej Pietruszczak for appreciated suggestions for improvements to an earlier version of this paper.  ... 
doi:10.12775/llp.1997.004 fatcat:qltije7fcrhc3kkpa2sanadexa

An infinitary model of linear logic [article]

Charles Grellois, Paul-André Melliès
2015 arXiv   pre-print
In this paper, we construct an infinitary variant of the relational model of linear logic, where the exponential modality is interpreted as the set of finite or countable multisets.  ...  We conclude the paper by sketching the connection between the resulting model of lambda-calculus with recursion and higher-order model-checking.  ...  model-checking  ... 
arXiv:1411.4380v3 fatcat:lxj4n52rqbardkoji5747wv3c4

An empirical analysis of modal theorem provers

Ullrich Hustadt, Renate A. Schmidt
1999 Journal of Applied Non-Classical Logics  
The theorem provers tested are the Davis-Putnam-based procedure Ksat, the tableaux-based system KRIS, the sequent-based Logics Workbench, and a translation approach combined with the rst-order theorem  ...  This paper reports on an empirical performance analysis of four modal theorem provers on benchmark suites of randomly generated formulae.  ...  Acknowledgements We thank the developers of Ksat, KRIS, and the Logics Workbench for making available the code of their systems.  ... 
doi:10.1080/11663081.1999.10510981 fatcat:yrqtthigtjcojh7xwoqxojqatu

Categorial Grammar at a Cross-Roads [chapter]

Johan van Benthem
2003 Studies in Linguistics and Philosophy  
Categorial grammars are driven by substructural logics. These are fragments of modal logics for the structures the grammar deals with.  ...  We will discuss modal language as a means of access to families of relevant structures: formal languages, type hierarchies, relation algebras-arrow models, and vector spaces.  ...  The most basic thing to do in a model is checking truth of formulas. As noted in Section 3.2, model checking of modal formulas takes polynomial time in the size of finite models.  ... 
doi:10.1007/978-94-010-0037-6_1 fatcat:2zl2pz3nsng7xnfds42jjfqzwa
« Previous Showing results 1 — 15 out of 8,803 results