#### Filter Results:

- Full text PDF available (41)

#### Publication Year

1994

2011

- This year (0)
- Last 5 years (0)
- Last 10 years (7)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

We study a generalized notion of topology which evolved from applications in the area of logic programming semantics The generalization is obtained by relaxing the requirement that a neighbourhood ofâ€¦ (More)

- Pascal Hitzler, Steffen HÃ¶lldobler, Anthony Karel Seda
- J. Applied Logic
- 2004

One facet of the question of integration of Logic and Connectionist Systems, and how these can complement each other, concerns the points of contact, in terms of semantics, between neural networksâ€¦ (More)

We consider the problem of nding models for logic programs P via xed points of immediate consequence operators TP Certain extensions of syntax invalidate the classical approach adopted in the case ofâ€¦ (More)

It is shown that continuity of a family of invariant (Haar) measures on a topological groupoid G is equivalent to the continuity of the implied convolution product f * g for all pairs of functions /â€¦ (More)

- Anthony Karel Seda
- Electr. Notes Theor. Comput. Sci.
- 2006

It is a long-standing and important problem to integrate logic-based systems and connectionist systems. In brief, this problem is concerned with how each of these two paradigms interacts with theâ€¦ (More)

- Anthony Karel Seda, Pascal Hitzler
- Comput. J.
- 2010

We discuss a number of distance functions encountered in the theory of computation, including metrics, ultra-metrics, quasi-metrics, generalized ultrametrics, partial metrics, d-ultra-metrics, andâ€¦ (More)

- Pascal Hitzler, Anthony Karel Seda
- IWFM
- 1999

In this paper, we discuss the semantics of disjunctive programs and databases and show how multivalued mappings and their fixed points arise naturally within this context. A number of fixed-pointâ€¦ (More)

- Pascal Hitzler, Anthony Karel Seda
- Electr. Notes Theor. Comput. Sci.
- 1999

Acceptable logic programs have been studied extensively in the context of proving termination of Prolog programs. It is diicult, however, to establish acceptability from the deenition since thisâ€¦ (More)

We discuss the computation by neural networks of semantic operators TP determined by propositional logic programs P over quite general many-valued logics T . We revisit and clarify the foundations ofâ€¦ (More)

- Anthony Karel Seda
- Fundam. Inform.
- 1997

Quasi-metrics have been used in several places in the literature on domain theory and the formal semantics of programming languages. In this paper, we consider the role of quasi-metrics in the xedâ€¦ (More)