Sciweavers

4117 search results - page 499 / 824
» On the Satisfiability of Complex Constraints
Sort
View
IJCAI
2003
15 years 8 months ago
Keys, Nominals, and Concrete Domains
Many description logics (DLs) combine knowledge tation on an abstract, logical level with an interface to “concrete” domains such as numbers and strings. We propose to extend ...
Carsten Lutz, Carlos Areces, Ian Horrocks, Ulrike ...
IJCAI
2003
15 years 8 months ago
The Concurrent, Continuous FLUX
FLUX belongs to the high-level programming languages for cognitive agents that have been developed in recent years. Based on the established, general action representation formali...
Yves Martins
ICGA
1997
103views Optimization» more  ICGA 1997»
15 years 8 months ago
Genetic Algorithm for Restrictive Channel Routing Problem
This paper presents a genetic algorithm for the restrictive channel routing problem. The major difference of the algorithm from already known genetic algorithms for this problem c...
Vladimir N. Davidenko, Victor M. Kureichik, Victor...
COLING
1994
15 years 8 months ago
Adjuncts and the Processing of Lexical Rules
The standard HPSG analysis of Germanic verb clusters can not explain the observed narrowscope readings of adjuncts in such verb clusters. We present an extension of the HPSG analy...
Gertjan van Noord, Gosse Bouma
CASC
2009
Springer
180views Mathematics» more  CASC 2009»
15 years 8 months ago
Effective Quantifier Elimination for Presburger Arithmetic with Infinity
We consider Presburger arithmetic extended by infinity. For this we give an effective quantifier elimination and decision procedure which implies also the completeness of our exten...
Aless Lasaruk, Thomas Sturm