14 citations · 29 across the 6 of their papers we have counts for
Showing 2004Show all
3 papers · 1 filter
cs.AI2004★ 2 cited
Default reasoning over domains and concept hierarchies
Pascal Hitzler
W.C. Rounds and G.-Q. Zhang (2001) have proposed to study a form of disjunctive logic programming generalized to algebraic domains. This system allows reasoning with information wh…
cs.AI2004★ 14 cited
The Integration of Connectionism and First-Order Knowledge Representation and Reasoning as a Challenge for Artificial Intelligence
Sebastian Bader, Pascal Hitzler, Steffen Hoelldobler
Intelligent systems based on first-order logic on the one hand, and on artificial neural networks (also called connectionist systems) on the other, differ substantially. It would b…
cs.AI2004★ 4 cited
Corollaries on the fixpoint completion: studying the stable semantics by means of the Clark completion
Pascal Hitzler
The fixpoint completion fix(P) of a normal logic program P is a program transformation such that the stable models of P are exactly the models of the Clark completion of fix(P). Th…