Sciweavers

164 search results - page 17 / 33
» Formalization and abstract implementation of rewriting with ...
Sort
View
CORR
1998
Springer
85views Education» more  CORR 1998»
13 years 7 months ago
The Proper Treatment of Optimality in Computational Phonology
Abstract. This paper presents a novel formalization of optimality theory. Unlike previous treatments of optimality in computational linguistics, starting with Ellison 1994, the n...
Lauri Karttunen
CSCLP
2008
Springer
13 years 9 months ago
An Efficient Decision Procedure for Functional Decomposable Theories Based on Dual Constraints
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
Khalil Djelloul
KBSE
2000
IEEE
13 years 11 months ago
Simultaneous Checking of Completeness and Ground Confluence
c specifications provide a powerful method for the specification of abstract data types in programming languages and software systems. Completeness and ground confluence are fundam...
Adel Bouhoula
DBPL
1995
Springer
144views Database» more  DBPL 1995»
13 years 11 months ago
An Algebraic Framework for Physical OODB Design
Physical design for object-oriented databases is still in its infancy. Implementation decisions often intrude into the conceptual design (such as inverse links and object decompos...
Leonidas Fegaras, David Maier
ISTA
2003
13 years 9 months ago
Managing Business Logic with Symbolic Computation
: A new approach of building enterprise distributed applications for layer of business rules as standard part of architecture is proposed in this paper. The approach uses symbolic ...
Ruslan Shevchenko, Anatoly E. Doroshenko