4617 search results - page 740 / 924 » Automation of Diagrammatic Reasoning |
176
click to vote
ICLP
2003
Springer
16 years 9 days ago
2003
Springer
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...
209
click to vote
ICLP
2003
Springer
16 years 9 days ago
2003
Springer
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...
146
click to vote
ICLP
2003
Springer
16 years 9 days ago
2003
Springer
We introduce a proposal to give argumentation capacity to databases. A database is said to have argumentation capacity if it can extract from the information available to it a set ...
207
click to vote
ICLP
2003
Springer
16 years 9 days ago
2003
Springer
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...
165
click to vote
ILP
2003
Springer
16 years 9 days ago
2003
Springer
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...