Sciweavers

342 search results - page 27 / 69
» Tableau Algorithms for Description Logics
Sort
View
CORR
2002
Springer
141views Education» more  CORR 2002»
13 years 8 months ago
Question answering: from partitions to Prolog
Abstract. We implement Groenendijk and Stokhof's partition semantics of questions in a simple question answering algorithm. The algorithm is sound, complete, and based on tabl...
Balder ten Cate, Chung-chieh Shan
SAC
2005
ACM
14 years 2 months ago
Knowledge based approach to semantic composition of teams in an organization
Finding rapidly suitable experts in an organization to compose a team able to solve specific tasks is a typical problem in large consulting firms. In this paper we present a Des...
Simona Colucci, Tommaso Di Noia, Eugenio Di Sciasc...
MKWI
2008
190views Business» more  MKWI 2008»
13 years 10 months ago
Partial Matchmaking for complex Product and Service Descriptions
: Matchmaking between offers and requests is an essential mechanism in electronic market places. Description Logics have been proposed as a appropriate framework for representing o...
Heiner Stuckenschmidt, Martin Kolb
CADE
2006
Springer
14 years 12 days ago
Presburger Modal Logic Is PSPACE-Complete
We introduce a Presburger modal logic PML with regularity constraints and full Presburger constraints on the number of children that generalize graded modalities, also known as num...
Stéphane Demri, Denis Lugiez
JWSR
2007
89views more  JWSR 2007»
13 years 8 months ago
Fully Automated Web Services Discovery and Composition Through Concept Covering and Concept Abduction
: We propose a framework and polynomial algorithms for semantic-based automated Web service composition, fully compliant with Semantic Web technologies. The approach exploits the r...
Azzurra Ragone, Tommaso Di Noia, Eugenio Di Sciasc...