Sciweavers

955 search results - page 11 / 191
» Tractable Temporal Reasoning
Sort
View
AAAI
2012
11 years 10 months ago
A Tractable First-Order Probabilistic Logic
Tractable subsets of first-order logic are a central topic in AI research. Several of these formalisms have been used as the basis for first-order probabilistic languages. Howev...
Pedro Domingos, William Austin Webb
BIRTHDAY
2000
Springer
13 years 11 months ago
Enhancing the tractability of rely/guarantee specifications in the development of interfering operations
Various forms of assumption/commitment specifications have been used to specify and reason about the interference that comes from concurrent execution; in particular, consistent a...
Pierre Collette, Cliff B. Jones
AIPS
2006
13 years 9 months ago
Tractable Optimal Competitive Scheduling
In this paper we describe the problem of Optimal Competitive Scheduling, which consists of activities that compete for a shared resource. The objective is to choose a subset of ac...
Jeremy Frank, James Crawford, Lina Khatib, Ronen I...
JUCS
2008
134views more  JUCS 2008»
13 years 7 months ago
A Tool for Reasoning about Qualitative Temporal Information: the Theory of S-languages with a Lisp Implementation
: Reasoning about incomplete qualitative temporal information is an essential topic in many artificial intelligence and natural language processing applications. In the domain of n...
Irène Durand, Sylviane R. Schwer
ATVA
2005
Springer
112views Hardware» more  ATVA 2005»
14 years 1 months ago
Reasoning About Transfinite Sequences
We introduce a family of temporal logics to specify the behavior of systems with Zeno behaviors. We extend linear-time temporal logic LTL to authorize models admitting Zeno sequen...
Stéphane Demri, David Nowak