3244 search results - page 479 / 649 » Extensions to Description Logics |
140
click to vote
LICS
2009
IEEE
16 years 1 months ago
2009
IEEE
We study the complexity of the propositional minimal inference problem. Its complexity has been extensively studied before because of its fundamental importance in artificial int...
168
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
We propose a crossover operator that works with genetic programming trees and is approximately geometric crossover in the semantic space. By defining semantic as program’s eval...
169
click to vote
ICCS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. In this paper, we extend Simple Conceptual Graphs with Reiter’s default rules. The motivation for this extension came from the type of reasonings involved in an agronom...
193
click to vote
PPDP
2009
Springer
16 years 1 months ago
2009
Springer
We introduce a logic programming framework for data type transformations based on isomorphisms between elementary data types (natural numbers, finite functions, sets and permutat...
142
click to vote
APLAS
2009
ACM
16 years 1 months ago
2009
ACM
Handling concurrency using a shared memory and locks is tedious and error-prone. One solution is to use message passing instead. We study here a particular, contract-based flavor ...