• Publications
  • Influence
On Conditionals
Towards a New Massively Parallel Computational Model for Logic Programming
It is shown that these metric methods can be directly implemented by recurrent connectionist networks giving rise to a new massively parallel computational model for logic programming. Expand
Approximating the Semantics of Logic Programs by Recurrent Neural Networks
A notion of approximation for interpretations is defined and it is proved that there exists a 3-layered feed forward neural network that approximates the calculation of TP for a given first order acyclic logic program P with an injective level mapping arbitrarily well. Expand
Foundations of Equational Logic Programming
This paper presents a meta-modelling framework for Universal Unification by Complete Sets of Transformations and Lazy Resolution and Complete sets of Inference Rules for Horn Equational Theories. Expand
On Indicative Conditionals
This paper presents a new approach to evaluate indicative conditionals with respect to some background information specified by a logic program and outlines an experiment to better understand how humans handle those cases. Expand
Logic programs and connectionist networks
It is shown that certain semantic operators for propositional logic programs can be computed by feedforward connectionist networks, and that the same semanticoperators for first-order normal logicprograms can be approximated by feed Forward Connectionist networks. Expand
The Fuzzy Linguistic Description Logic ALC
We present the fuzzy linguistic description logic ALCFL, an instance of the description logic framework LALC with the certainty lattice characterized by a hedge algebra. Beside constructors of L-ALC,Expand
The Fuzzy Description Logic ALCFH with Hedge Algebras as Concept Modifiers
This paper presents the fuzzy description logic ALCFH, where primitive concepts are modified by means of hedges taken from hedge algebras, and extends [8] by allowing modifiers on non-primitive concepts and extending the satisfiability procedure to handle concept definitions. Expand
A Fuzzy Description Logic with Hedges as Concept Modifiers
This paper presents a fuzzy description logic, where primitive concepts are modified by means of hedges, and defines a decision procedure for the unsatisfiability problem in , and discusses truth bounds, expressivity as well as complexity issues. Expand
The Subsumption Problem of the Fuzzy Description Logic ALCFH
The fuzzy description logic ALCFH is presented where primitive concepts are modified by means of hedges taken from hedge algebras and it is shown that given a linearly ordered set of hedge primitive concepts can be modified to any desired degree by prefixing them with appropriate chains of hedging. Expand