Sciweavers

346 search results - page 57 / 70
» Optimizing Terminological Reasoning for Expressive Descripti...
Sort
View
LACL
2001
Springer
13 years 11 months ago
On the Distinction between Model-Theoretic and Generative-Enumerative Syntactic Frameworks
Abstract. Two kinds of framework for stating grammars of natural languages emerged during the 20th century. Here we call them generativeenumerative syntax (GES) and model-theoretic...
Geoffrey K. Pullum, Barbara C. Scholz
DLOG
2011
12 years 10 months ago
Implementing Completion-Based Inferences for the EL-family
Completion algorithms for subsumption are investigated for many extensions of the description logic EL. While for several of them subsumption is tractable, this is no longer the ca...
Julian Mendez, Andreas Ecke, Anni-Yasmin Turhan
LPAR
1999
Springer
13 years 11 months ago
A Partial Evaluation Framework for Curry Programs
In this work, we develop a partial evaluation technique for residuating functional logic programs, which generalize the concurrent computation models for logic programs with delays...
Elvira Albert, María Alpuente, Michael Hanu...
ECBS
2008
IEEE
124views Hardware» more  ECBS 2008»
13 years 8 months ago
Hierarchical Model to Develop Component-Based Systems
Large and complex software systems require expressive notations for representing their software architecture. In this context Architecture Description Languages (ADLs) can be used...
Abdelkrim Amirat, Mourad Oussalah
LPAR
2004
Springer
14 years 2 days ago
A Decomposition Rule for Decision Procedures by Resolution-Based Calculi
Resolution-based calculi are among the most widely used calculi for theorem proving in first-order logic. Numerous refinements of resolution are nowadays available, such as e.g. ...
Ullrich Hustadt, Boris Motik, Ulrike Sattler