Sciweavers

579 search results - page 86 / 116
» Combined reasoning by automated cooperation
Sort
View
ICLP
2003
Springer
14 years 24 days ago
On Deterministic Computations in the Extended Andorra Model
Logic programming is based on the idea that computation is controlled inference. The Extended Andorra Model provides a very powerful framework that supports both co-routining and p...
Ricardo Lopes, Vítor Santos Costa, Fernando...
ICLP
2003
Springer
14 years 24 days ago
Order and Negation as Failure
We equip ordered logic programs with negation as failure, using a simple generalization of the preferred answer set semantics for ordered programs. This extension supports a conven...
Davy Van Nieuwenborgh, Dirk Vermeir
ICLP
2003
Springer
14 years 24 days ago
Concurrency, Time, and Constraints
Concurrent constraint programming (ccp) is a model of concurrency for systems in which agents (also called processes) interact with one another by telling and asking information in...
Frank D. Valencia
ILP
2003
Springer
14 years 24 days ago
Comparative Evaluation of Approaches to Propositionalization
Propositionalization has already been shown to be a particularly promising approach for robustly and effectively handling relational data sets for knowledge discovery. In this pap...
Mark-A. Krogel, Simon Rawles, Filip Zelezný...
CAV
2008
Springer
130views Hardware» more  CAV 2008»
13 years 9 months ago
A Hybrid Type System for Lock-Freedom of Mobile Processes
We propose a type system for lock-freedom in the -calculus, which guarantees that certain communications will eventually succeed. Distinguishing features of our type system are: it...
Naoki Kobayashi, Davide Sangiorgi