A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
Filters
Some Progress in Satisfiability Checking for Difference Logic
[chapter]
2004
Lecture Notes in Computer Science
Preserved Fulltext
In this paper we report a new SAT solver for difference logic, a propositional logic enriched with timing constraints. ...
This and other improvements lead to significant performance gains for some classes of problems. ...
We thank Moez Mahfoudh for his thesis through which we all took our first lessons in the domain. ...
doi:10.1007/978-3-540-30206-3_19
fatcat:edlusbo7a5dmfb3haydp2typca
Reasoning about Robot Actions: A Model Checking Approach
[chapter]
2002
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
Model-checking can then be used as a means for verifying and planning robot actions with respect to such behaviors. ...
This paper discusses the use of model-checking to reason about robot actions in this context. ...
If the statement is specified as a formula in temporal logic, then the problem becomes to check that the execution sequence satisfies the formula; in other words, we check that the execution sequence is ...
doi:10.1007/3-540-37724-7_8
fatcat:tiwpg2v4fre53ohxmx3su27kje
A Progressive Simplifier for Satisfiability Modulo Theories
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In this paper we present a new progressive cooperating simplifier for deciding the satisfiability of a quantifier-free formula in the first-order theory of integers involving combinations of sublogics, ...
This is made possible by adopting our novel inter-logic implication framework, as proposed in this paper. ...
terms of atoms in different logics. ...
doi:10.1007/11814948_20
fatcat:wx36r3aqfvdz7pqj7f7otqerj4
Disjunctive Normal Form for Multi-Agent Modal Logics Based on Logical Separability
2019
PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In this paper, we first introduce a notion of logical separability and then define a novel disjunctive normal form SDNF for the multiagent logic Kn, which overcomes some shortcomings of existing approaches ...
One technique of tackling the intractability is to identify a fragment called a normal form of multiagent logics such that it is expressive but tractable for reasoning tasks such as entailment checking ...
Acknowledgments We are grateful to Yongmei Liu, Dacheng Wen and Fang Lv for their helpful discussions on the paper. ...
doi:10.1609/aaai.v33i01.33012817
fatcat:4f6dwrvdfnbwtmn5zyt6qmsozy
A Theory of Hints in Model Checking
[chapter]
2003
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
But another important class of properties, progress (liveness) properties, which state that program execution eventually reaches some specified set of states, has been difficult to model-check as they, ...
In this paper, we propose that progress properties can be checked more efficiently if they are accompanied by hints as to why they hold. ...
Progress Progress properties are specified using the leads-to operator in UNITY logic, formulae of the form AG(p ⇒ AFq) in CTL, or formulae like G(p ⇒ Fq) in linear temporal logic. ...
doi:10.1007/978-3-540-40007-3_25
fatcat:z65mqzhhwrdwbjjfvhftervigi
Switching logic synthesis for reachability
2010
Proceedings of the tenth ACM international conference on Embedded software - EMSOFT '10
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
The system to be controlled is a dynamical system that can operate in different modes. ...
The goal is to synthesize the logic for switching between the modes so that the desired reachability property holds. ...
We thank the referees for their insightful comments. ...
doi:10.1145/1879021.1879025
dblp:conf/emsoft/TalyT10
fatcat:txv7ybhenjhvrnvfbvijpjhahq
Analyzing LTL Model Checking Techniques for Plan Synthesis and Controller Synthesis (Work in Progress)
2006
Electronical Notes in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
These alternatives are presented in connection with three different applications of model checking: verification, plan synthesis as well as heuristic guidance of AI planning, and controller synthesis. ...
In this paper, we present alternative means of handling invariances in reachability testing, either by formula progression or compilation into Büchi automata. ...
Such properties will progress to when satisfied, but will never progress to ⊥. Handling such cases require an extension that explicitly checks for U formulas [13] . ...
doi:10.1016/j.entcs.2005.07.028
fatcat:ddzuwe6sbrbx7mp5x7zcruccbm
Knowledge Compilation in Multi-Agent Epistemic Logics
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2018 pre-print arXiv:1806.10561v1 fatcat:db6zsawrtzbkjmgxglnog6fzb4
Epistemic logics are a primary formalism for multi-agent systems but major reasoning tasks in such epistemic logics are intractable, which impedes applications of multi-agent epistemic logics in automatic ...
The property of logical separability allows to decompose a formula into some of its subformulas and thus modular algorithms for various reasoning tasks can be developed. ...
Logical separable terms have the modularity property for satisfiability check and forgetting. ...
arXiv:1806.10561v2
fatcat:rdzrkai5qjhqpje7t5r35gakzm
Temporal Team Semantics Revisited
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
and satisfiability problems. ...
We consider three logics: TeamLTL, TeamCTL and TeamCTL*, which are obtained by adding quantification over so-called time evaluation functions controlling the asynchronous progress of traces. ...
Consequently, two different modes of TeamLTL satisfaction naturally emerge: existential (a formula is satisfied by some initial tef) and universal (a formula is satisfied by all initial tefs) satisfaction ...
arXiv:2110.12699v1
fatcat:ehdd4d2q3rac5dwmnsl3jbd5k4
Page 4761 of Mathematical Reviews Vol. , Issue 94h
[page]
1994
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
for finite lattices (or lattices satisfying the chain condition). ...
Summary: “Using the notion of progress measures, we discuss ver- ification methods for proving that a program satisfies a property specified by an automaton having finite nondeterminism. ...
Fluent temporal logic for discrete-time event-based models
2005
Proceedings of the 10th European software engineering conference held jointly with 13th ACM SIGSOFT international symposium on Foundations of software engineering - ESEC/FSE-13
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Fluent model checking is an automated technique for verifying that an event-based operational model satisfies some state-based declarative properties. ...
The existing fluent temporal logic is convenient for reasoning about untimed event-based models but difficult to use for timed models. ...
For model verification, the properties to be satisfied by the architecture are typically expressed in some form of temporal logic. ...
doi:10.1145/1081706.1081719
dblp:conf/sigsoft/LetierKMU05
fatcat:46mto65d2bbf5brwjzvszf3yhm
Fluent temporal logic for discrete-time event-based models
2005
Software engineering notes
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Fluent model checking is an automated technique for verifying that an event-based operational model satisfies some state-based declarative properties. ...
The existing fluent temporal logic is convenient for reasoning about untimed event-based models but difficult to use for timed models. ...
For model verification, the properties to be satisfied by the architecture are typically expressed in some form of temporal logic. ...
doi:10.1145/1095430.1081719
fatcat:5h5isdk2gbfxldup4goigajyky
A method for the synthesis of controllers to handle safety, liveness, and real-time constraints
1998
IEEE Transactions on Automatic Control
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
requirements expressed by metric temporal logic (MTL) formulas. ...
First, the issues of controllability, safety, liveness, and real time are integrated in a single framework. ...
Thistle for his discussion on -controllability. ...
doi:10.1109/9.728871
fatcat:aesr7r5jh5b4vbvvnv53jxelv4
Temporal property preservation under Z refinement in CSP-OZ specifications
2012
2012 International Conference on Computer & Information Science (ICCIS)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
As the development of the system progresses from one step to another, the correctness of the concrete specification is verified by checking the satisfaction of the properties. ...
This paper extends the result on LTL property preservation for Z specifications in [2] to the OZ part of CSP-OZ specifications. ...
We can then model check the temporal structure to check for the holding of a property. We will do this in this paper and the same is also done in [2] for checking properties under Z refinement. ...
doi:10.1109/iccisci.2012.6297152
fatcat:rbvmhcgwnfcf7bkxw2cgy65nly
LTL-based verification of reconfigurable workflows
2014
Applied Mathematical Sciences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2016 pre-print arXiv:1607.03649v1 fatcat:z3erqmo7zndbrnnwiccwh3l6xy
Logics and model-checking have been successfully used in the last decades for modeling and verification of various types of hardware (and software) systems. ...
The objective of this paper is demonstrating how temporal logics and model checking are effective in proving properties of dynamic, reconfigurable and adaptable systems. ...
I would like to acknowledge the help given by numerous colleagues, in particular: Anirban Bhattacharyya, Marcello Maria Bersani and Luca Ferrucci. ...
doi:10.12988/ams.2014.410816
fatcat:6peagyeli5fzbhlhl3vdtkhs6i
« Previous
Showing results 1 — 15 out of 158,241 results