Sciweavers

2145 search results - page 19 / 429
» Lax Logical Relations
Sort
View
ACL
1997
13 years 9 months ago
Interleaving Universal Principles and Relational Constraints over Typed Feature Logic
We introduce a typed feature logic system providing both universal implicational principles as well as definite clauses over feature terms. We show that such an architecture suppo...
Thilo Götz, Detmar Meurers
AB
2007
Springer
14 years 1 months ago
Relating Attractors and Singular Steady States in the Logical Analysis of Bioregulatory Networks
Abstract. In 1973 R. Thomas introduced a logical approach to modeling and analysis of bioregulatory networks. Given a set of Boolean functions describing the regulatory interaction...
Heike Siebert, Alexander Bockmayr
KCAP
2003
ACM
14 years 28 days 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
EUROPAR
1995
Springer
13 years 11 months ago
Relating Data-Parallelism and (And-) Parallelism in Logic Programs
Much work has been done in the areas of and–parallelism and data parallelism in Logic Programs. Such work has proceeded to a certain extent in an independent fashion. Both types...
Manuel V. Hermenegildo, Manuel Carro
CORR
2008
Springer
90views Education» more  CORR 2008»
13 years 7 months ago
Effective Complexity and its Relation to Logical Depth
Abstract--Effective complexity measures the information content of the regularities of an object. It has been introduced by M. Gell-Mann and S. Lloyd to avoid some of the disadvant...
Nihat Ay, Markus Mueller, Arleta Szkola