Sciweavers

756 search results - page 54 / 152
» Using Logic Programs to Reason about Infinite Sets
Sort
View
FLOPS
1999
Springer
15 years 2 months ago
Using Types as Approximations for Type Checking Prolog Programs
Abstract. Subtyping tends to undermine the effects of parametric polymorphism as far as the static detection of type errors is concerned. Starting with this observation we present...
Christoph Beierle, Gregor Meyer
TABLEAUX
2000
Springer
15 years 1 months ago
Benchmark Analysis with FaCT
FaCT (Fast Classification of Terminologies) is a Description Logic (DL) classifier that can also be used for modal logic satisfiability testing. The FaCT system includes two reason...
Ian Horrocks
DKE
2010
167views more  DKE 2010»
14 years 9 months ago
The consistency extractor system: Answer set programs for consistent query answering in databases
We describe the Consistency Extractor System (ConsEx) that computes consistent answers to Datalog queries with negation posed to relational databases that may be inconsistent with...
Mónica Caniupán Marileo, Leopoldo E....
TPLP
2002
117views more  TPLP 2002»
14 years 9 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...
ALT
2004
Springer
15 years 6 months ago
Probabilistic Inductive Logic Programming
Probabilistic inductive logic programming, sometimes also called statistical relational learning, addresses one of the central questions of artificial intelligence: the integratio...
Luc De Raedt, Kristian Kersting