The system cc⊤ is a tool for testing correspondence between nonmonotonic logic programs under the answer-set semantics with respect to different refined notions of program correspondence. The basic architecture of cc⊤ is to reduce a given correspondence problem into the satisfiability problem for quantified propositional logic and to employ off-the-shelf solvers for the latter language as backe...

Lawvere theories provide a category theoretic view of equational logic, identifying equational theories with small categories equipped with finite products. This formulation allows equational theories to be investigated as first class mathematical entities. However, many formal systems, particularly in computer science, are described by equations modulated by side conditions asserting the “fres...

One of the main problems in FCA (especially in fuzzy setting) is to reduce a concept lattice to appropriate size to make it graspable and understandable. We generalize known results on the correspondence of block relations of formal contexts and complete tolerances on concept lattices to fuzzy setting. Using an illustrative example we show that the results can be used for reduction of fuzzy con...

The connection between logic programming and formal argumentation has been studied starting from the landmark 1995 paper of Dung. Subsequent work identified a standard translation programs to (instantiated) frameworks, under which pairwise correspondences hold various semantics semantics. This includes correspondence 3-valued stable complete semantics, well-founded grounded 2-valued (LP) (argum...

This paper explains the principles of dependency analysis by reduction and its correspondence to the notions of dependency and dependency tree. The explanation is illustrated by examples from Czech, a language with a relatively high degree of word-order freedom. The paper sums up the basic features of methods of dependency syntax. The method serves as a basis for the verification (and explanati...

In Optimality Theory, an important tool for accounting for morpho-phonological processes is output-output correspondence. A development of this approach is Transderivational Anti-Faithfulness (TAF), constituting a reversal of faithfulness. This article will explore the nature of TAF, in order to test this approach as an extension of Optimality Theory. The example of morphologically triggered ac...

Our aim in this paper is to point out a surprising formal connection, between two topics which seem on face value to have nothing to do with each other: relational database theory, and the study of non-locality and contextuality in the foundations of quantum mechanics. We shall show that there is a remarkably direct correspondence between central results such as Bell’s theorem in the foundation...

Timing aspects in formalisms with explicit resources and parallelism are investigated, and it is presented a formal link between timed membrane systems and timed Petri nets with localities. For both formalisms, timing does not increase the expressive power; however both timed membrane systems and timed Petri nets are more flexible in describing molecular phenomena where time is a critical resou...

Jan car et al (1995) developed the restarting automaton as a formal model of certain syn-tactical aspects of natural languages. Here we mainly concentrate on the deterministic version of the restarting automaton and its variants, establishing some inclusion results for the class of Church-Rosser languages. In addition, it is shown that there is a close correspondence between various classes of ...

We give a formal definition of HD-automata based on coalgebras. Exploiting such definition we formally specify and implement a minimisation algorithm for HD-automata derived from π-calculus agents. The algorithm is a generalisation of the partition refinement algorithm for classical automata and is specified as a coalgebraic construction defined using λ ∏ , a polymorphic λ-calculus with depende...