Sciweavers

1071 search results - page 179 / 215
» Modal Logics, Description Logics and Arithmetic Reasoning
Sort
View
CADE
2002
Springer
14 years 8 months ago
Lazy Theorem Proving for Bounded Model Checking over Infinite Domains
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
Harald Rueß, Leonardo Mendonça de Mou...
WWW
2006
ACM
14 years 1 months ago
ASDL: a wide spectrum language for designing web services
A Service oriented system emerges from composition of services. Dynamically composed reactive Web services form a special class of service oriented system, where the delays associ...
Monika Solanki, Antonio Cau, Hussein Zedan
KR
2010
Springer
14 years 14 days ago
Status QIO: Conjunctive Query Entailment Is Decidable
Description Logics (DLs) are knowledge representation formalisms that provide, for example, the logical underpinning of the W3C OWL standards. Conjunctive queries (CQs), the stand...
Birte Glimm, Sebastian Rudolph
ICCBR
2009
Springer
13 years 5 months ago
On Similarity Measures Based on a Refinement Lattice
Abstract. Retrieval of structured cases using similarity has been studied in CBR but there has been less activity on defining similarity on description logics (DL). In this paper w...
Santiago Ontañón, Enric Plaza
ASWC
2008
Springer
13 years 9 months ago
Scalable Distributed Ontology Reasoning Using DHT-Based Partitioning
Abstract. Ontology reasoning is an indispensable step to fully exploit the implicit semantics of Semantic Web data. The inherent distribution characteristic of the Semantic Web and...
Qiming Fang, Ying Zhao, Guangwen Yang, Weimin Zhen...