Sciweavers

593 search results - page 57 / 119
» RDF and Logic: Reasoning and Extension
Sort
View
ICLP
1994
Springer
15 years 4 months ago
Compiling Intensional Sets in CLP
Constructive negation has been proved to be a valid alternative to negation as failure, especially when negation is required to have, in a sense, an `active' role. In this pa...
Paola Bruscoli, Agostino Dovier, Enrico Pontelli, ...
AIIA
1997
Springer
15 years 4 months ago
Introducing Abduction into (Extensional) Inductive Logic Programming Systems
We propose an approach for the integration of abduction and induction in Logic Programming. In particular, we show how it is possible to learn an abductive logic program starting f...
Evelina Lamma, Paola Mello, Michela Milano, Fabriz...
128
Voted
DLOG
2011
14 years 4 months ago
Local Closed World Semantics: Keep it simple, stupid!
A combination of open and closed-world reasoning (usually called local closed world reasoning) is a desirable capability of knowledge representation formalisms for Semantic Web app...
Adila Alfa Krisnadhi, Kunal Sengupta, Pascal Hitzl...
157
Voted
ICLP
2011
Springer
14 years 4 months ago
Transaction Logic with Defaults and Argumentation Theories
Transaction Logic is an extension of classical logic that gracefully integrates both declarative and procedural knowledge and has proved itself as a powerful formalism for many ad...
Paul Fodor, Michael Kifer
95
Voted
LPNMR
1997
Springer
15 years 4 months ago
Power Defaults
This paper introduces power default reasoning (PDR), a framework for nonmonotonic reasoning based on the domain-theoretic idea of modeling default rules with partial-information i...
Guo-Qiang Zhang, William C. Rounds