| 2009 |
|---|
| 25 | EE | Anthony Karel Seda,
Menouer Boubekeur,
Ted Hurley,
Mícheál Mac an Airchinnigh,
Michel P. Schellekens,
Glenn Strong:
Preface.
Electr. Notes Theor. Comput. Sci. 225: 1-2 (2009) |
| 24 | EE | Ekaterina Komendantskaya,
Anthony Karel Seda:
Sound and Complete SLD-Resolution for Bilattice-Based Annotated Logic Programs.
Electr. Notes Theor. Comput. Sci. 225: 141-159 (2009) |
| 23 | EE | Máire Lane,
Anthony Karel Seda:
Properties of General Semantic Operators Determined by Logic-Based Systems.
Electr. Notes Theor. Comput. Sci. 225: 181-194 (2009) |
| 2008 |
|---|
| 22 | | Turlough Neary,
Damien Woods,
Anthony Karel Seda,
Niall Murphy:
Complexity of Simple Programs 2008, CSP 2008, Cork, Ireland, December 6-7, 2008. Proceedings
Cork University Press 2008 |
| 2007 |
|---|
| 21 | EE | Anthony Karel Seda:
Morphisms of ANN and the Computation of Least Fixed Points of Semantic Operators.
IWINAC (1) 2007: 224-233 |
| 20 | EE | Ekaterina Komendantskaya,
Máire Lane,
Anthony Karel Seda:
Connectionist Representation of Multi-Valued Logic Programs.
Perspectives of Neural-Symbolic Integration 2007: 283-313 |
| 2006 |
|---|
| 19 | EE | Anthony Karel Seda,
Ted Hurley,
Michel P. Schellekens,
Mícheál Mac an Airchinnigh,
Glenn Strong:
Preface.
Electr. Notes Theor. Comput. Sci. 161: 1-2 (2006) |
| 18 | EE | Anthony Karel Seda:
On the Integration of Connectionist and Logic-Based Systems.
Electr. Notes Theor. Comput. Sci. 161: 109-130 (2006) |
| 2004 |
|---|
| 17 | EE | Pascal Hitzler,
Steffen Hölldobler,
Anthony Karel Seda:
Logic programs and connectionist networks.
J. Applied Logic 2(3): 245-272 (2004) |
| 2003 |
|---|
| 16 | EE | Anthony Karel Seda,
Máire Lane:
On Continuous Models of Computation: Towards Computing the Distance Between (Logic) Programs.
IWFM 2003 |
| 15 | EE | Pascal Hitzler,
Anthony Karel Seda:
Continuity of Semantic Operators in Logic Programming and Their Approximation by Artificial Neural Networks.
KI 2003: 355-369 |
| 14 | EE | Pascal Hitzler,
Anthony Karel Seda:
Generalized metrics and uniquely determined logic programs.
Theor. Comput. Sci. 305(1-3): 187-219 (2003) |
| 2001 |
|---|
| 13 | EE | Pascal Hitzler,
Anthony Karel Seda:
VDM meets LCF: Domain-Theoretic and Topological Aspects of VDM.
IWFM 2001 |
| 2000 |
|---|
| 12 | EE | Pascal Hitzler,
Anthony Karel Seda:
A Note on the Relationships Between Logic Programs and Neural Networks.
IWFM 2000 |
| 11 | EE | Pascal Hitzler,
Anthony Karel Seda:
On the Coincidence of Semantics for Uniquely Determined Programs.
Electr. Notes Theor. Comput. Sci. 40: (2000) |
| 10 | EE | Anthony Karel Seda:
Preface.
Electr. Notes Theor. Comput. Sci. 40: (2000) |
| 1999 |
|---|
| 9 | | Pascal Hitzler,
Anthony Karel Seda:
A Characterization of Acceptability.
ICLP 1999: 609 |
| 8 | | Pascal Hitzler,
Anthony Karel Seda:
Multivalued Mappings, Fixed-Point Theorems and Disjunctive Databases.
IWFM 1999 |
| 7 | EE | Pascal Hitzler,
Anthony Karel Seda:
Characterizations of Classes of Programs by Three-Valued Operators.
LPNMR 1999: 357-371 |
| 6 | EE | Pascal Hitzler,
Anthony Karel Seda:
Acceptable Programs Revisited.
Electr. Notes Theor. Comput. Sci. 30(1): (1999) |
| 1998 |
|---|
| 5 | | Anthony Karel Seda,
Pascal Hitzler:
Strictly Level-Decreasing Logic Programs.
IWFM 1998 |
| 1997 |
|---|
| 4 | | Anthony Karel Seda:
Quasi-Metrics and the Semantics of Logic Programs.
Fundam. Inform. 29(1-2): 97-117 (1997) |
| 1996 |
|---|
| 3 | | Anthony Karel Seda:
Quasi-Metrics and Fixed Points in Computing.
Bulletin of the EATCS 60: 154-163 (1996) |
| 1994 |
|---|
| 2 | | Anthony Karel Seda:
Some Applications of General Topology To The Semantics of Logic Programms.
Bulletin of the EATCS 52: 279-291 (1994) |
| 1 | | Anthony Karel Seda:
A Topological View of the Kowalski - Van Emden Theorem.
Bulletin of the EATCS 53: 256-263 (1994) |
