Sciweavers

784 search results - page 3 / 157
» The logic of tasks
Sort
View
SBIA
2004
Springer
13 years 11 months ago
Towards Polynomial Approximations of Full Propositional Logic
Abstract. The aim of this paper is to study a family of logics that approximates classical inference, in which every step in the approximation can be decided in polynomial time. Fo...
Marcelo Finger
PPCP
1993
13 years 10 months ago
Higher-Order Logic Programming as Constraint Logic Programming
Higher-order logic programming (HOLP) languages are particularly useful for various kinds of metaprogramming and theorem proving tasks because of the logical support for variable ...
Spiro Michaylov, Frank Pfenning
BIRTHDAY
2005
Springer
13 years 11 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
PDP
2009
IEEE
14 years 23 days ago
Task-Parallel versus Data-Parallel Library-Based Programming in Multicore Systems
—Multicore machines are becoming common. There are many languages, language extensions and libraries devoted to improve the programmability and performance of these machines. In ...
Diego Andrade, Basilio B. Fraguela, James C. Brodm...
AINA
2007
IEEE
14 years 9 days ago
OWL-Based Context-Dependent Task Modeling and Deducing
In the near future, homes are envisioned to be equipped with numerous intelligent communicating devices. Such smart home needs to exhibit highly adaptive behavior to meet the inha...
Hongbo Ni, Xingshe Zhou, Zhiwen Yu, Kejian Miao