42 search results - page 2 / 9 » The Complexity of Propositional Linear Temporal Logics in Si... |
ACOM
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. This paper explores the use of temporal logics in the context of communication protocols for multiagent systems. We concentrate on frameworks where protocols are used to ...
FROCOS
2007
Springer
13 years 11 months ago
2007
Springer
In abstract algebra, a structure is said to be Noetherian if it does not admit infinite strictly ascending chains of congruences. In this paper, we adapt this notion to first-ord...
JAIR
2002
13 years 4 months ago
2002
We develop, analyze, and evaluate a novel, supervised, specific-to-general learner for a simple temporal logic and use the resulting algorithm to learn visual event definitions fr...
ECAI
1992
Springer
13 years 9 months ago
1992
Springer
ABSTRACT. This paper investigates the problem of finding subclasses of nonmonotonic reasoning which can be implemented efficiently. The ability to "define" propositions u...
IJCAI
2007
13 years 6 months ago
2007
Temporal reasoning is widely used within both Computer Science and A.I. However, the underlying complexity of temporal proof in discrete temporal logics has led to the use of simp...