Sciweavers

3758 search results - page 12 / 752
» A Complete Subsumption Algorithm
Sort
View
ILP
1997
Springer
13 years 11 months ago
A Logical Framework for Graph Theoretical Decision Tree Learning
Abstract. We present a logical approach to graph theoretical learning that is based on using alphabetic substitutions for modelling graph morphisms. A classi ed graph is represente...
Peter Geibel, Fritz Wysotzki
LPAR
1999
Springer
13 years 11 months ago
Practical Reasoning for Expressive Description Logics
Abstract. Description Logics (DLs) are a family of knowledge representation formalisms mainly characterised by constructors to build complex concepts and roles from atomic ones. Ex...
Ian Horrocks, Ulrike Sattler, Stephan Tobies
CORR
2011
Springer
185views Education» more  CORR 2011»
13 years 2 months ago
Sound and Complete Query Answering in Intensional P2P Data Integration
Contemporary use of the term ’intension’ derives from the traditional logical doctrine that an idea has both an extension and an intension. In this paper we introduce an intens...
Zoran Majkic
JAIR
1998
163views more  JAIR 1998»
13 years 7 months ago
A Temporal Description Logic for Reasoning about Actions and Plans
A class of interval-based temporal languages for uniformly representing and reasoning about actions and plans is presented. Actions are represented by describing what is true whil...
Alessandro Artale, Enrico Franconi
CONSTRAINTS
2011
13 years 2 months ago
A global constraint for total weighted completion time for unary resources
We introduce a novel global constraint for the total weighted completion time of activities on a single unary capacity resource. For propagating the constraint, we propose an O(n4...
András Kovács, J. Christopher Beck