Sciweavers

2989 search results - page 169 / 598
» Using Domain-Independent Problems for Introducing Formal Met...
Sort
View
KCAP
2003
ACM
15 years 3 months ago
Using transformations to improve semantic matching
Many AI tasks require determining whether two knowledge representations encode the same knowledge. Solving this matching problem is hard because representations may encode the sam...
Peter Z. Yeh, Bruce W. Porter, Ken Barker
POPL
2011
ACM
14 years 27 days ago
Making prophecies with decision predicates
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...
Byron Cook, Eric Koskinen
BIRTHDAY
2005
Springer
15 years 3 months ago
Planning in Answer Set Programming using Ordered Task Decomposition
abstract. In this paper we investigate a formalism for solving planning problems based on ordered task decomposition using Answer Set Programming (ASP). Our planning methodology is...
Jürgen Dix, Ugur Kuter, Dana S. Nau
WACV
2005
IEEE
15 years 3 months ago
Temporal Synchronization of Video Sequences in Theory and in Practice
— In this work, we present a formalization of the video synchronization problem that exposes new variants of the problem that have been left unexplored to date. We also present a...
Anthony Whitehead, Robert Laganière, Prosen...
FOSSACS
2008
Springer
14 years 11 months ago
Footprints in Local Reasoning
Local reasoning about programs exploits the natural local behaviour common in programs by focussing on the footprint - that part of the resource accessed by the program. We address...
Mohammad Raza, Philippa Gardner