191 search results - page 14 / 39 » Temporal Extensions to Defeasible Logic |
98
Voted
LFCS
2009
Springer
15 years 2 months ago
2009
Springer
We extend the alternating-time temporal logics ATL and ATL with strategy contexts and memory constraints: the first extension makes strategy quantifiers to not “forget” the s...
103
click to vote
LICS
2007
IEEE
15 years 4 months ago
2007
IEEE
Nested words are a structured model of execution paths in procedural programs, reflecting their call and return nesting structure. Finite nested words also capture the structure ...
LICS
2005
IEEE
15 years 3 months ago
2005
IEEE
We consider unranked trees, that have become an active subject of study recently due to XML applications, and characterize commonly used fragments of firstorder (FO) and monadic ...
75
Voted
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
The IEEE standardized Property Specification Language, PSL for short, extends the well-known linear-time temporal logic LTL with so-called semi-extended regular expressions. PSL an...
AUSAI
2009
Springer
15 years 4 months ago
2009
Springer
Model checking games are instances of Hintikka’s game semantics for logic used for purposes of debugging systems verification models. Previous work in the area has developed the...