Sciweavers

330 search results - page 29 / 66
» Effective Complexity and its Relation to Logical Depth
Sort
View
KR
2000
Springer
13 years 11 months ago
Anytime Diagnostic Reasoning using Approximate Boolean Constraint Propagation
In contrast with classical reasoning, where a solution is either correct or incorrect, approximate reasoning tries to compute solutions which are close to the ideal solution, with...
Alan Verberne, Frank van Harmelen, Annette ten Tei...
JLP
2007
159views more  JLP 2007»
13 years 7 months ago
Reasoning about interaction protocols for customizing web service selection and composition
This work faces the problem of web service selection and composition, discussing the advantages that derive from the inclusion, in a web service declarative description, of the hi...
Matteo Baldoni, Cristina Baroglio, Alberto Martell...
TPLP
2002
117views more  TPLP 2002»
13 years 7 months ago
On Properties of Update Sequences Based on Causal Rejection
In this paper, we consider an approach to update nonmonotonic knowledge bases represented as extended logic programs under the answer set semantics. In this approach, new informat...
Thomas Eiter, Michael Fink, Giuliana Sabbatini, Ha...
SIGMOD
1997
ACM
159views Database» more  SIGMOD 1997»
13 years 12 months ago
On-Line Warehouse View Maintenance
Data warehouses store materialized views over base data from external sources. Clients typically perform complex read-only queries on the views. The views are refreshed periodical...
Dallan Quass, Jennifer Widom
AAAI
2000
13 years 9 months ago
DATALOG with Constraints - An Answer-Set Programming System
Answer-set programming (ASP) has emerged recently as a viable programming paradigm well attuned to search problems in AI, constraint satisfaction and combinatorics. Propositional ...
Deborah East, Miroslaw Truszczynski