1032 search results - page 3 / 207 » Extended Computation Tree Logic |
103
click to vote
RTA
2000
Springer
15 years 1 months ago
2000
Springer
Parallelism constraints are logical descriptions of trees. Parallelism constraints subsume dominance constraints and are equal in expressive power to context unification. Paralleli...
74
Voted
FLAIRS
2008
14 years 12 months ago
2008
This paper presents proposals of certain extensions to the XTT knowledge representation model, a method of tabular specification for rule-based systems. The extensions concern
RTA
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Declarative debugging is a semi-automatic technique that starts from an incorrect computation and locates a program fragment responsible for the error by building a tree ...
MFCS
2009
Springer
15 years 4 months ago
2009
Springer
In a data word or a data tree each position carries a label from a finite alphabet and a data value from an infinite domain. Over data words we consider the logic LTL↓ 1(F), th...