3134 search results - page 39 / 627 » Computing full disjunctions |
SOFSEM
2005
Springer
14 years 3 months ago
2005
Springer
We give a new characterization of those languages that are definable in fragments of LTL where the nesting depths of X and U modalities are bounded by given constants. This brings...
AMAI
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. Partial equilibrium logic (PEL) is a new nonmonotonic reasoning formalism closely aligned with logic programming under well-founded and partial stable model semantics. In...
DLOG
2007
14 years 6 days ago
2007
Abstract. Concept approximation is an inference service for Description Logics that provides “translations” of concept descriptions from one DL to a less expressive DL. In [4] ...
AAAI
2006
13 years 11 months ago
2006
Even under polynomial restrictions on plan length, conformant planning remains a very hard computational problem as plan verification itself can take exponential time. This heavy ...
TCS
2010
13 years 8 months ago
2010
The refinement calculus of Back, Morgan, Morris, and others is based on monotone predicate transformers (weakest preconditions) where conjunctions stand for demonic choices betwee...