Ekaterina Komendantskaya

11 Connectionist Representation of Multi-Valued Logic Programs (2009)

We propose a (limited) solution to the problem of constructing stream values defined by recursive equations that do not respect the guardedness condition. The guardedness condition is imposed on...

Ekaterina Komendantskaya, Máire Lane, Anthony Karel Seda

Summary. Hölldobler and Kalinke showed how, given a propositional logic program P, a 3-layer feedforward artificial neural network may be constructed, using only binary threshold units, which can...

Sound and complete sld-resolution for bilattice-based annotated logic programs (2008)

Ekaterina Komendantskaya, Anthony Karel Seda

We introduce the class of normal bilattice-based annotated first-order logic programs (BAPs) and develop declarative and operational semantics for them. In particular, SLD-resolution for these...

Sound and complete sld-resolution for bilattice-based annotated logic programs (2008)

Ekaterina Komendantskaya, Anthony Karel Seda

We introduce the class of normal bilattice-based annotated first-order logic programs (BAPs) and develop declarative and operational semantics for them. In particular, SLD-resolution for these...

annotated (2008)

found at the ENTCS Macro Home Page. Inductive and Coinductive Components of Corecursive Functions in Coq (2008)

many-sorted semantics for many-valued

Yves Bertot, Inria Sophia Antipolis, Ekaterina Komendantskaya

Replace this file with prentcsmacro.sty for your meeting,

We address the problem of constructing stream values de- ﬁned by recursive equations that do not respect directly the guarded- ness condition, and we concentrate in particular on equations...

We address the problem of constructing stream values de- ﬁned by recursive equations that do not respect directly the guarded- ness condition, and we concentrate in particular on equations...

We address the problem of constructing stream values de- ﬁned by recursive equations that do not respect directly the guarded- ness condition, and we concentrate in particular on equations...

Inductive and Coinductive Components of Corecursive Functions in Coq (2008)

We address the problem of constructing stream values de- ﬁned by recursive equations that do not respect directly the guarded- ness condition, and we concentrate in particular on equations...

Inductive and Coinductive Components of Corecursive Functions in Coq (2008)

In Constructive Type Theory, recursive and corecursive definitions are subject to syntactic restrictions which guarantee termination for recursive functions and productivity for corecursive...

Inductive and Coinductive Components of Corecursive Functions in Coq (2008)

In Constructive Type Theory, recursive and corecursive deﬁnitions are subject to syntactic restrictions which guarantee termination for recursive functions and productivity for corecursive...

In Constructive Type Theory, recursive and corecursive deﬁnitions are subject to syntactic restrictions which guarantee termination for recursive functions and productivity for corecursive...

and (2008)

Fibrational semantics for many-valued logic programs: grounds for non-groundness. (2008)

Learning and deduction in neural networks

Komendantskaya, Ekaterina, Power, John

We introduce a ﬁbrational semantics for many-valued logic programming, use it to deﬁne an SLD-resolution for annotation-free many valued logic programs as deﬁned by Fitting, and...

Inductive and Coinductive Components of Corecursive Functions in Coq (2008)

Fibrational semantics for many-valued logic programs: grounds for non-groundness. (2008)

In Constructive Type Theory, recursive and corecursive deﬁnitions are subject to syntactic restrictions which guarantee termination for recursive functions and productivity for corecursive...

Komendantskaya, Ekaterina, Power, John

We introduce a ﬁbrational semantics for many-valued logic programming, use it to deﬁne an SLD-resolution for annotation-free many valued logic programs as deﬁned by Fitting, and...

Inductive and Coinductive Components of Corecursive Functions in Coq (2008)

In Constructive Type Theory, recursive and corecursive deﬁnitions are subject to syntactic restrictions which guarantee termination for recursive functions and productivity for corecursive...

We address the problem of constructing stream values de- ﬁned by recursive equations that do not respect directly the guarded- ness condition, and we concentrate in particular on equations...

We address the problem of constructing stream values de- ﬁned by recursive equations that do not respect directly the guarded- ness condition, and we concentrate in particular on equations...

We propose a (limited) solution to the problem of constructing stream values defined by recursive equations that do not respect the guardedness condition. The guardedness condition is imposed on...

First-order deduction in neural networks (2007)

We propose a (limited) solution to the problem of constructing stream values defined by recursive equations that do not respect the guardedness condition. The guardedness condition is imposed on...

A sequent calculus for bilattice-based logic and its many-sorted representation (2007)

Abstract. We show how the algorithm of SLD-resolution for first-order logic programs can be performed in connectionist neural networks. The most significant properties of the resulting neural...

Learning and Deduction in Neural Networks and Logic (2007)

Abstract. We introduce a sequent calculus for bilattice-based annotated logic (BAL). We show that this logic can be syntactically and semantically translated into a fragment MSL ∗ of conventional...