| Nome |
# |
|
A Model Checking Procedure for Interval Temporal Logics based on Track Representatives, file e27ce0c2-6c2b-055e-e053-6605fe0a7873
|
291
|
|
A SAT-Based Encoding of the One-Pass and Tree-Shaped Tableau System for LTL, file e27ce0c7-258e-055e-e053-6605fe0a7873
|
275
|
|
A novel automata-theoretic approach to timeline-based planning, file e27ce0c9-6ed1-055e-e053-6605fe0a7873
|
247
|
|
Adding the relation meets to the temporal logic of prefixes and infixes makes It EXPSPACEL-complete, file e27ce0c9-fe41-055e-e053-6605fe0a7873
|
245
|
|
SATISFIABILITY AND MODEL CHECKING FOR THE LOGIC OF SUB-INTERVALS UNDER THE HOMOGENEITY ASSUMPTION, file e27ce0ca-27fd-055e-e053-6605fe0a7873
|
231
|
|
A Road Map of Interval Temporal Logics and Duration Calculi, file e27ce0c1-dc8f-055e-e053-6605fe0a7873
|
213
|
|
Metric propositional neighborhood logic with an equivalence relation, file e27ce0c3-bf11-055e-e053-6605fe0a7873
|
212
|
|
Decidability results for metric and layered temporal logics, file e27ce0c1-e532-055e-e053-6605fe0a7873
|
207
|
|
A graph-theoretic approach to map conceptual designs to XML schemas, file e27ce0c1-e559-055e-e053-6605fe0a7873
|
189
|
|
An in-depth investigation of interval temporal logic model checking with regular expressions, file e27ce0c4-9279-055e-e053-6605fe0a7873
|
162
|
|
Which Fragments of the Interval Temporal Logic HS are Tractable in Model Checking?, file e27ce0c5-24df-055e-e053-6605fe0a7873
|
143
|
|
Maximal decidable fragments of Halpern and Shoham's modal logic of intervals, file e27ce0c1-d817-055e-e053-6605fe0a7873
|
139
|
|
A map-matching algorithm dealing with sparse cellular fingerprint observations, file e27ce0c6-15c7-055e-e053-6605fe0a7873
|
137
|
|
Model Checking the Logic of Allen's Relations Meets and Started-by is P^NP-Complete, file e27ce0c2-f36b-055e-e053-6605fe0a7873
|
136
|
|
On the relationships between theories of time granularity and the monadic second-order theory of one successor, file e27ce0c1-cc9e-055e-e053-6605fe0a7873
|
134
|
|
Model Checking for Fragments of the Interval Temporal Logic HS at the Low Levels of the Polynomial Time Hierarchy, file e27ce0c5-24e1-055e-e053-6605fe0a7873
|
133
|
|
Prompt interval temporal logic, file e27ce0c3-bf15-055e-e053-6605fe0a7873
|
127
|
|
Complete and Terminating Tableau for the Logic of Proper Subinterval Structures over Dense Orderings, file e27ce0c1-cd99-055e-e053-6605fe0a7873
|
112
|
|
Constraining Cycle Alternations in Model Checking for Interval Temporal Logic, file e27ce0c2-e7c5-055e-e053-6605fe0a7873
|
112
|
|
On the complexity of model checking for syntactically maximal fragments of the interval temporal logic hs with regular expressions, file e27ce0c4-9050-055e-e053-6605fe0a7873
|
112
|
|
Model checking for fragments of Halpern and Shoham's interval temporal logic based on track representatives, file e27ce0c4-977f-055e-e053-6605fe0a7873
|
112
|
|
Interval-based Synthesis, file e27ce0c1-f7a2-055e-e053-6605fe0a7873
|
103
|
|
A complete classification of the expressiveness of interval logics of Allen’s relations: the general and the dense cases, file e27ce0c2-648a-055e-e053-6605fe0a7873
|
103
|
|
Complexity of Timeline-Based Planning over Dense Temporal Domains: Exploring the Middle Ground, file e27ce0c5-96b1-055e-e053-6605fe0a7873
|
99
|
|
Undecidability of the Logic of Overlap Relation over Discrete Linear Orderings, file e27ce0c1-f4c6-055e-e053-6605fe0a7873
|
98
|
|
On the complexity of fragments of the modal logic of Allen’s relations over dense structures, file e27ce0c2-6500-055e-e053-6605fe0a7873
|
93
|
|
An Optimal Decision Procedure for MPNL over the Integers, file e27ce0c1-d152-055e-e053-6605fe0a7873
|
85
|
|
Games, Automata, Logic, and Formal Verification (GandALF 2013) - Special Issue of the journal Information and Computation, Editorial pp. 1-2, file e27ce0c2-64e7-055e-e053-6605fe0a7873
|
79
|
|
Satisfiability and model checking for the logic of sub-intervals under the homogeneity assumption, file e27ce0c4-8c45-055e-e053-6605fe0a7873
|
58
|
|
Bounded Timed Propositional Temporal Logic with past captures timeline-based planning with bounded constraints, file e27ce0c5-51c9-055e-e053-6605fe0a7873
|
57
|
|
A New Tableau-based Satisfiability Checker for Linear Temporal Logic, file e27ce0c2-ed03-055e-e053-6605fe0a7873
|
54
|
|
Timelines Are Expressive Enough to Capture Action-Based Temporal Planning, file e27ce0c3-52fd-055e-e053-6605fe0a7873
|
51
|
|
OSASUD: A dataset of stroke unit recordings for the detection of Obstructive Sleep Apnea Syndrome, file e27ce0c9-eda7-055e-e053-6605fe0a7873
|
50
|
|
On Propositional Interval Neighborhood Temporal Logics, file e27ce0c1-c9f0-055e-e053-6605fe0a7873
|
49
|
|
Leviathan: A New LTL Satisfiability Checking Tool Based on a One-Pass Tree-Shaped Tableau, file e27ce0c9-8e22-055e-e053-6605fe0a7873
|
47
|
|
Expressiveness of Extended Bounded Response LTL, file e27ce0c9-d1e6-055e-e053-6605fe0a7873
|
47
|
|
Interval temporal logic model checking: The border between good and bad HS fragments, file e27ce0c2-f366-055e-e053-6605fe0a7873
|
43
|
|
Leviathan: A New LTL Satisfiability Checking Tool Based on a One-Pass Tree-Shaped Tableau, file e27ce0c2-eff9-055e-e053-6605fe0a7873
|
38
|
|
A Framework for Indoor Positioning Including Building Topology, file a8366cde-4acd-49de-813e-efd84c9c115a
|
33
|
|
Model Checking Well-Behaved Fragments of HS: The (Almost) Final Picture, file e27ce0c2-f369-055e-e053-6605fe0a7873
|
30
|
|
Reactive Synthesis from Extended Bounded Response LTL Specifications, file e27ce0c9-0abf-055e-e053-6605fe0a7873
|
29
|
|
Timeline-Based Planning over Dense Temporal Domains with Trigger-less Rules is NP-Complete, file e27ce0c5-96b5-055e-e053-6605fe0a7873
|
26
|
|
Interval vs. Point Temporal Logic Model Checking: an Expressiveness Comparison, file e27ce0c3-4dfd-055e-e053-6605fe0a7873
|
25
|
|
Interval vs. Point Temporal Logic Model Checking: an Expressiveness Comparison, file e27ce0c5-96ae-055e-e053-6605fe0a7873
|
25
|
|
Branching within Time: an Expressively Complete and Elementarily Decidable Temporal Logic for Time Granularity, file e27ce0c1-eb59-055e-e053-6605fe0a7873
|
24
|
|
Complexity of qualitative timeline-based planning, file e27ce0c9-d884-055e-e053-6605fe0a7873
|
24
|
|
A Graph-Theoretic Approach to Efficiently Reason about Partially Ordered Events in (Modal) Event Calculus, file e27ce0c1-d486-055e-e053-6605fe0a7873
|
21
|
|
Object migration in temporal object-oriented databases, file e27ce0c1-caa1-055e-e053-6605fe0a7873
|
20
|
|
Decidability and complexity of the fragments of the modal logic of Allen's relations over the rationals, file e27ce0c9-7832-055e-e053-6605fe0a7873
|
19
|
|
Monitors that Learn from Failures: Pairing STL and Genetic Programming, file c0500844-697e-449a-b0e7-8baf0a34cdaf
|
18
|
|
Pspace-completeness of the temporal logic of sub-intervals and suffixes, file e27ce0c9-e1c0-055e-e053-6605fe0a7873
|
18
|
|
Virtual sensing and sensors selection for efficient temperature monitoring in indoor environments†, file e27ce0c9-bbff-055e-e053-6605fe0a7873
|
16
|
|
Crowdsourced Reconstruction of Cellular Networks to Serve Outdoor Positioning: Modeling, Validation and Analysis, file 229cc104-412c-471b-8315-4236f931d2e3
|
15
|
|
Proceedings of the 1st Symposium on Games, Automata, Logic, and Formal Verification (GandALF), file e27ce0c1-d998-055e-e053-6605fe0a7873
|
14
|
|
Decidability of the interval temporal logic ABB* over the natural numbers, file e27ce0c1-ee7b-055e-e053-6605fe0a7873
|
14
|
|
Extending Kamp's Theorem to Model Time Granularity, file e27ce0c1-ccaf-055e-e053-6605fe0a7873
|
13
|
|
Interval Temporal Logic Model Checking Based on Track Bisimilarity and Prefix Sampling, file e27ce0c2-f17e-055e-e053-6605fe0a7873
|
12
|
|
On a temporal logic of prefixes and infixes, file e27ce0c9-08ed-055e-e053-6605fe0a7873
|
11
|
|
BLACK: A fast, flexible and reliable LTL satisfiability checker, file e27ce0ca-2b79-055e-e053-6605fe0a7873
|
10
|
|
Beyond $omega BS$-regular Languages: $omegaT$-regular Expressions and Counter-Check Automata, file e27ce0c9-7ed0-055e-e053-6605fe0a7873
|
9
|
|
Evaluation of Temporal Datasets via Interval Temporal Logic Model Checking, file e27ce0c9-7ed6-055e-e053-6605fe0a7873
|
8
|
|
Extended ω-Regular Languages and Interval Temporal Logic, file e27ce0ca-08d9-055e-e053-6605fe0a7873
|
6
|
|
Expressiveness of Extended Bounded Response LTL, file 90be4426-c386-4d42-9ffe-f1410febb42e
|
5
|
|
An Original Approach to Positioning with Cellular Fingerprints Based on Decision Tree Ensembles, file e27ce0c5-05b9-055e-e053-6605fe0a7873
|
5
|
|
Controller Synthesis for Timeline-based Games, file 73697086-69f6-4442-b576-63f2d737786b
|
4
|
|
Decision tree pruning via multi-objective evolutionary computation, file e27ce0c5-04a5-055e-e053-6605fe0a7873
|
4
|
|
AIOSA: An approach to the automatic identification of obstructive sleep apnea events based on deep learning, file e27ce0c9-a814-055e-e053-6605fe0a7873
|
4
|
|
Fairness, assumptions, and guarantees for extended bounded response LTL+P synthesis, file 80b36179-869d-46b6-b66e-8ad2c365b521
|
3
|
|
Towards Learning an Optimal Metric for Fingerprint-based Localisation, file bfd575db-2368-4314-9ee8-f50e5c4be947
|
3
|
|
Interval Temporal Logics: a Journey, file e27ce0c1-de5b-055e-e053-6605fe0a7873
|
3
|
|
What's decidable about Halpern and Shoham's interval logic? The maximal fragment ABBbarLbar, file e27ce0c1-de86-055e-e053-6605fe0a7873
|
3
|
|
A complete classification of the expressiveness of interval logics of Allen's relations over dense linear orders, file e27ce0c1-f58f-055e-e053-6605fe0a7873
|
3
|
|
Checking interval properties of computations, file e27ce0c2-6488-055e-e053-6605fe0a7873
|
3
|
|
Adding one or more equivalence relations to the interval temporal logic ABBbar, file e27ce0c2-657b-055e-e053-6605fe0a7873
|
3
|
|
Towards Compact and Tractable Automaton-Based Representations of Time Granularities, file e27ce0c7-5f7d-055e-e053-6605fe0a7873
|
3
|
|
Qualitative past Timeline-Based Games, file e60fb9bd-30c0-489e-965d-57632916b65f
|
3
|
|
A FIRST-ORDER LOGIC CHARACTERIZATION OF SAFETY AND CO-SAFETY LANGUAGES, file 3ce2899a-0199-4194-884e-514486a0fb21
|
2
|
|
LTL over Finite Words Can Be Exponentially More Succinct Than Pure-Past LTL, and vice versa, file b15bb297-c3c1-4ad3-a952-424fc83ff70b
|
2
|
|
Special issue on Interval Temporal Logics and Duration Calculi - Editorial, file e27ce0c1-d185-055e-e053-6605fe0a7873
|
2
|
|
From Entity Relationship to XML Schema: A Graph-Theoretic Approach, file e27ce0c1-ed5c-055e-e053-6605fe0a7873
|
2
|
|
Complexity of ITL model checking: some well-behaved fragments of the interval logic HS, file e27ce0c2-631a-055e-e053-6605fe0a7873
|
2
|
|
Complexity of timeline-based planning, file e27ce0c5-57bb-055e-e053-6605fe0a7873
|
2
|
|
Decidability and Complexity of Action-Based Temporal Planning over Dense Time, file e27ce0c9-040a-055e-e053-6605fe0a7873
|
2
|
|
PSPACE-completeness of the temporal logic of sub-intervals and suffixes, file 40107bde-1be1-4366-8970-0d53680d2734
|
1
|
|
A Theory of Ultimately Periodic Languages and Automata with an Application to Time Granularity, file e27ce0c1-cddc-055e-e053-6605fe0a7873
|
1
|
|
The light side of Interval Temporal Logics: the Bernays-Schoenfinkel's fragment of CDT, file e27ce0c1-d1c6-055e-e053-6605fe0a7873
|
1
|
|
Modal deduction in second-order logic and set theory. I, file e27ce0c1-d53f-055e-e053-6605fe0a7873
|
1
|
|
A Contraction Method to Decide MSO Theory of Deterministic Trees, file e27ce0c1-d7df-055e-e053-6605fe0a7873
|
1
|
|
An optimal tableau for Right Propositional Neighborhood Logic over trees, file e27ce0c1-da41-055e-e053-6605fe0a7873
|
1
|
|
Modal deduction in second-order logic and set theory. II, file e27ce0c1-e3a2-055e-e053-6605fe0a7873
|
1
|
|
Morphos Configuration Engine: the Core of a Commercial Configuration System in CLP(FD), file e27ce0c1-ec92-055e-e053-6605fe0a7873
|
1
|
|
Metric Propositional Neighborhood Logics: expressiveness, decidability, and undecidability, file e27ce0c1-ee01-055e-e053-6605fe0a7873
|
1
|
|
Crossing the undecidability border with extensions of propositional neighborhood logic over natural numbers, file e27ce0c1-f498-055e-e053-6605fe0a7873
|
1
|
|
Interval logics and omegaB-regular languages, file e27ce0c1-f51d-055e-e053-6605fe0a7873
|
1
|
|
A tableau system for right propositional neighborhood logic over finite linear orders: An implementation, file e27ce0c1-f51e-055e-e053-6605fe0a7873
|
1
|
|
The light side of interval temporal logic: The Bernays-Schönfinkel fragment of CDT, file e27ce0c1-f793-055e-e053-6605fe0a7873
|
1
|
|
Decidability of the interval temporal logic AA*BB* over the rationals, file e27ce0c1-f79c-055e-e053-6605fe0a7873
|
1
|
|
Adding two equivalence relations to the interval temporal logic AB, file e27ce0c1-f79e-055e-e053-6605fe0a7873
|
1
|
|
Undecidability of Chop, file e27ce0c2-6c26-055e-e053-6605fe0a7873
|
1
|
|
A graph-theoretic approach to map conceptual designs to XML schemas, file e27ce0c3-3a03-055e-e053-6605fe0a7873
|
1
|
| Totale |
5.343 |