Results 11  20
of
150
Features and Formulae
, 1991
"... This paper shows how these structures can be axiomatized in a decidable class of firstorder logic, which can also be used to express constraints on these structures. Desirable properties, such as compactness and decidability, follow directly. Moreover, additional types of feature values, such as "s ..."
Abstract

Cited by 26 (1 self)
 Add to MetaCart
This paper shows how these structures can be axiomatized in a decidable class of firstorder logic, which can also be used to express constraints on these structures. Desirable properties, such as compactness and decidability, follow directly. Moreover, additional types of feature values, such as "setvalued" features, can be incorporated into the system simply by axiomatizing their properties
On the Combination of Symbolic Constraints, Solution Domains, and Constraint Solvers
 In Proceedings of the First International Conference on Principles and Practice of Constraint Programming
"... When combining languages for symbolic constraints, one is typically faced with the problem of how to treat "mixed" constraints. The two main problems are (1) how to define a combined solution structure over which these constraints are to be solved, and (2) how to combine the constraint solving metho ..."
Abstract

Cited by 26 (3 self)
 Add to MetaCart
When combining languages for symbolic constraints, one is typically faced with the problem of how to treat "mixed" constraints. The two main problems are (1) how to define a combined solution structure over which these constraints are to be solved, and (2) how to combine the constraint solving methods for pure constraints into one for mixed constraints. The paper introduces the notion of a "free amalgamated product" as a possible solution to the first problem. Subsequently, we define socalled simplycombinable structures (SCstructures). For SCstructures over disjoint signatures, a canonical amalgamation construction exists, which for the subclass of strong SCstructures yields the free amalgamated product. The combination technique of [BS92, BaS94a] can be used to combine constraint solvers for (strong) SCstructures over disjoint signatures into a solver for their (free) amalgamated product. In addition to term algebras modulo equational theories, the class of SCstru...
Distributivity for Endofunctors, Pointed and CoPointed Endofunctors, Monads and Comonads
, 2000
"... We generalise the notion of a distributive law between a monad and a comonad to consider weakened structures such as pointed or copointed endofunctors, or endofunctors. We investigate EilenbergMoore and Kleisli constructions for each of these possibilities. Then we consider two applications of the ..."
Abstract

Cited by 24 (1 self)
 Add to MetaCart
We generalise the notion of a distributive law between a monad and a comonad to consider weakened structures such as pointed or copointed endofunctors, or endofunctors. We investigate EilenbergMoore and Kleisli constructions for each of these possibilities. Then we consider two applications of these weakened notions of distributivity in detail. We characterise Turi and Plotkin's model of GSOS as a distributive law of a monad over a copointed endofunctor, and we analyse generalised coiteration and coalgebraic coinduction \upto" in terms of a distributive law of the underlying pointed endofunctor of a monad over an endofunctor. 1 Work supported by Esprit Working Group \Types", MURST'99 Con. \Sistemi Formali. .." grant. 2 This work is supported by EPSRC grants GR/J84205: Frameworks for programming language semantics and logic and GR/M56333: The structure of programming languages : syntax and semantics, and British Council grant 747 FCS R34807: Data and program renement using alg...
Hypercomputation and the Physical ChurchTuring Thesis
, 2003
"... A version of the ChurchTuring Thesis states that every e#ectively realizable physical system can be defined by Turing Machines (`Thesis P'); in this formulation the Thesis appears an empirical, more than a logicomathematical, proposition. We review the main approaches to computation beyond Turing ..."
Abstract

Cited by 21 (0 self)
 Add to MetaCart
A version of the ChurchTuring Thesis states that every e#ectively realizable physical system can be defined by Turing Machines (`Thesis P'); in this formulation the Thesis appears an empirical, more than a logicomathematical, proposition. We review the main approaches to computation beyond Turing definability (`hypercomputation'): supertask, nonwellfounded, analog, quantum, and retrocausal computation. These models depend on infinite computation, explicitly or implicitly, and appear physically implausible; moreover, even if infinite computation were realizable, the Halting Problem would not be a#ected. Therefore, Thesis P is not essentially di#erent from the standard ChurchTuring Thesis.
A Logical Treatment of SemiFree Word Order and Bounded Discontinuous Constituency
, 1989
"... free word order and bounded discontinuous constituency. We extend standard feature value logics to treat word order in a single formalism with a rigorous semantics without phrase structure rules. The elimination of phrase structure rules allows a natural generalisation of the approach to nonconfigur ..."
Abstract

Cited by 20 (0 self)
 Add to MetaCart
free word order and bounded discontinuous constituency. We extend standard feature value logics to treat word order in a single formalism with a rigorous semantics without phrase structure rules. The elimination of phrase structure rules allows a natural generalisation of the approach to nonconfigurational word order and bounded discontinuous continuency via sequence union. Sequence union formalises the notions of clause union and scrambling by providing a mechanism for describing word order domains larger than the local tree. The formalism incorporates the distinction between bounded and unbounded forms of discontinuous constituency. Grammars are organised as algebraic theories. This means that linguistic generalisations are stated as axioms about the structure of signs. This permits a natural interpretation of implicational universals in terms of theories, subtheories and implicational axioms. The accompanying linguistic analysis is eclectic, borrowing insights from many current linguistic theories.
Back and forth bisimulations
 Computer Science Report CS R9021, Centrum voor Wiskunde en Informatica
, 1990
"... This paper is concerned with bisimulation relations which do not only require related agents to simulate each others behavior in the direction of the arrows, but also to simulate each other when going back in history. First it is demonstrated that the back and forth variant of strong bisimulation le ..."
Abstract

Cited by 20 (2 self)
 Add to MetaCart
This paper is concerned with bisimulation relations which do not only require related agents to simulate each others behavior in the direction of the arrows, but also to simulate each other when going back in history. First it is demonstrated that the back and forth variant of strong bisimulation leads to the same equivalence as the ordinary notion of strong bisimulation. Then it is shown that the back and forth variant of Milner's observation equivalence is different from (and finer than) observation equivalence. In fact we prove that it coincides with the branching bisimulation equivalence of Van Glabbeek & Weijland. Also the back and forth variants of branching, ~ and delay bisimulation lead to branching bisimulation equivalence. The notion of back and forth bisimulation moreover leads to characterizations of branching bisimulation in terms of abstraction homomorphisms and in terms of HencessyMilner logic with backward modalities. In our view these results support the claim that branching bisimulation is a natural and important notion. The notion of bisimulation relation has been introduced by PARK [18]. It leads to an equivalence on labelled transition systems which, in case image finiteness is assumed, coincides with the strong equivalence of ~IILNER [12]. The great importance and usefulness of bisimulalions
Final Universes of Processes
 PROC. MATH. FOUNDATIONS OF PROGRAMMING SEMANTICS. SPRINGER LECT. NOTES COMP. SCI. (802
, 1994
"... We describe the final universe approach to the characterisation of semantic universes and illustrate it by giving characterisations of the universes of CCS and CSP processes. ..."
Abstract

Cited by 19 (1 self)
 Add to MetaCart
We describe the final universe approach to the characterisation of semantic universes and illustrate it by giving characterisations of the universes of CCS and CSP processes.
A SetTheoretic Translation Method for Polymodal Logics
, 1995
"... The paper presents a settheoretic translation method for polymodal logics that reduces the derivability problem of a large class of propositional polymodal logics to the derivability problem of a very weak firstorder set theory\Omega\Gamma Unlike most existing translation methods, the one we propos ..."
Abstract

Cited by 19 (12 self)
 Add to MetaCart
The paper presents a settheoretic translation method for polymodal logics that reduces the derivability problem of a large class of propositional polymodal logics to the derivability problem of a very weak firstorder set theory\Omega\Gamma Unlike most existing translation methods, the one we proposed applies to any normal complete finitelyaxiomatizable polymodal logic, regardless if it is firstorder complete or if an explicit semantics is available for it. Moreover, the finite axiomatizability of\Omega makes it possible to implement mechanical proof search procedures via the deduction theorem or more specialized and efficient techniques. In the last part of the paper, we briefly discuss the application of set T resolution to support automated derivability in (a suitable extension of) \Omega\Gamma This work has been supported by funds MURST 40% and 60%. The second author was supported by a grant from the Italian Consiglio Nazionale delle Ricerche (CNR). 1 Introduction The paper...
Bounded Hyperset Theory and Weblike Data Bases
 Computational Logic and Proof Theory, 5th Kurt Gödel Colloquium, KGC’97, Springer LNCS
, 1997
"... this paper rather abstract, \static" settheoretic view on the WorldWide Web (WWW) or, more generally, on Weblike Data Bases (WDB) and on the corresponding querying to WDB. Let us stress that it is not only about databases with an access via Web. The database itself should be organized in the same ..."
Abstract

Cited by 18 (5 self)
 Add to MetaCart
this paper rather abstract, \static" settheoretic view on the WorldWide Web (WWW) or, more generally, on Weblike Data Bases (WDB) and on the corresponding querying to WDB. Let us stress that it is not only about databases with an access via Web. The database itself should be organized in the same way as Web. I.e. it must consist of hyperlinked pages distributed among the computers participating either in global network like Internet or in some local, isolated from the outside world specic network based essentially on the same principles, except globality, and called also Intranet [15].