Sciweavers

1545 search results - page 112 / 309
» Defeasible Description Logics
Sort
View
ESANN
1997
13 years 9 months ago
Extraction of crisp logical rules using constrained backpropagation networks
Two recently developed methods for extraction of crisp logical rules from neural networks trained with backpropagation algorithm are compared. Both methods impose constraints on th...
Wlodzislaw Duch, Rafal Adamczak, Krzysztof Grabcze...
OWLED
2008
13 years 9 months ago
Representing Product Designs Using a Description Graph Extension to OWL 2
Product development requires the ability to check design consistency, to verify design properties, and to answer questions about a design's possible implementations. These tas...
Henson Graves
ICLP
1995
Springer
13 years 11 months ago
Variants of the Event Calculus
Abstract. The Event Calculus is a narrative based formalism for reasoning about actions and change originally proposed in logic programming form by Kowalski and Sergot. In this pap...
Fariba Sadri, Robert A. Kowalski
CADE
1998
Springer
14 years 6 days ago
System Description: card TAP: The First Theorem Prover on a Smart Card
Abstract. We present the first implementation of a theorem prover running on a smart card. The prover is written in Java and implements a dual tableau calculus. Due to the limited ...
Rajeev Goré, Joachim Posegga, Andrew Slater...
AAAI
2010
13 years 9 months ago
Past and Future of DL-Lite
We design minimal temporal description logics that are capable of expressing various aspects of temporal conceptual data models and investigate their computational complexity. We ...
Alessandro Artale, Roman Kontchakov, Vladislav Ryz...