Sciweavers

2067 search results - page 120 / 414
» Logics of propositional control
Sort
View
CSCLP
2007
Springer
15 years 8 months ago
Quasi-Linear-Time Algorithms by Generalisation of Union-Find in CHR
Abstract. The union-find algorithm can be seen as solving simple equations between variables or constants. With a few lines of code change, we generalise its implementation in CHR...
Thom W. Frühwirth
96
Voted
ICTAC
2007
Springer
15 years 8 months ago
On the Expressive Power of QLTL
LTL cannot express the whole class of ω-regular languages and several extensions have been proposed. Among them, Quantified propositional Linear Temporal Logic (QLTL), proposed b...
Zhilin Wu
ICTL
1994
15 years 5 months ago
Abduction in Temporal Reasoning
Commonsense knowledge often omits the temporal incidence of facts, and even the ordering between occurrences is only available for some of their instances. Reasoning about the temp...
Cristina Ribeiro, António Porto
147
Voted
JELIA
2010
Springer
15 years 7 days ago
Sets of Boolean Connectives That Make Argumentation Easier
Abstract. Many proposals for logic-based formalizations of argumentation consider an argument as a pair (Φ, α), where the support Φ is understood as a minimal consistent subset ...
Nadia Creignou, Johannes Schmidt, Michael Thomas, ...
102
Voted
AUTOMATICA
2004
100views more  AUTOMATICA 2004»
15 years 1 months ago
Supervisory control with state-dependent dwell-time logic and constraints
The paper deals with the supervisory control of a nonlinear uncertain system in which the switching is directed by the recently introduced state-dependent dwell-time switching log...
Claudio De Persis, Raffaella De Santis, A. Stephen...