Sciweavers

110 search results - page 18 / 22
» Restrictions on Tree Adjoining Languages
Sort
View
KCAP
2003
ACM
14 years 1 months ago
Modularisation of domain ontologies implemented in description logics and related formalisms including OWL
Modularity is a key requirement for large ontologies in order to achieve re-use, maintainability, and evolution. Mechanisms for ‘normalisation’ to achieve analogous aims are s...
Alan L. Rector
TCS
2010
13 years 6 months ago
Translating propositional extended conjunctions of Horn clauses into Boolean circuits
Horn⊃ is a logic programming language which extends usual Horn clauses by adding intuitionistic implication in goals and clause bodies. This extension can be seen as a form of s...
Joxe Gaintzarain, Montserrat Hermo, Paqui Lucio, M...
TAGT
1994
Springer
185views Graph Theory» more  TAGT 1994»
13 years 12 months ago
Concatenation of Graphs
An operation of concatenation is introduced for graphs. Then strings are viewed as expressions denoting graphs, and string languages are interpreted as graph languages. For a clas...
Joost Engelfriet, Jan Joris Vereijken
CORR
1998
Springer
110views Education» more  CORR 1998»
13 years 7 months ago
Ultrametric Distance in Syntax
Phrase structure trees have a hierarchical structure. In many subjects, most notably in taxonomy such tree structures have been studied using ultrametrics. Here syntactical hierar...
Mark D. Roberts
LICS
2009
IEEE
14 years 2 months ago
Functional Reachability
—What is reachability in higher-order functional programs? We formulate reachability as a decision problem in the setting of the prototypical functional language PCF, and show th...
C.-H. Luke Ong, Nikos Tzevelekos