Sciweavers

3244 search results - page 360 / 649
» Extensions to Description Logics
Sort
View
152
Voted
CORR
2007
Springer
162views Education» more  CORR 2007»
15 years 6 months ago
Order-Invariant MSO is Stronger than Counting MSO in the Finite
We compare the expressiveness of two extensions of monadic second-order logic (MSO) over the class of finite structures. The first, counting monadic second-order logic (CMSO), ex...
Tobias Ganzow, Sasha Rubin
AAAI
2000
15 years 8 months ago
DATALOG with Constraints - An Answer-Set Programming System
Answer-set programming (ASP) has emerged recently as a viable programming paradigm well attuned to search problems in AI, constraint satisfaction and combinatorics. Propositional ...
Deborah East, Miroslaw Truszczynski
ICCAD
2005
IEEE
141views Hardware» more  ICCAD 2005»
16 years 3 months ago
Architecture and compilation for data bandwidth improvement in configurable embedded processors
Many commercially available embedded processors are capable of extending their base instruction set for a specific domain of applications. While steady progress has been made in t...
Jason Cong, Guoling Han, Zhiru Zhang
JSS
2006
111views more  JSS 2006»
15 years 6 months ago
Declarative programming of integrated peer-to-peer and Web based systems: the case of Prolog
Web and peer-to-peer systems have emerged as popular areas in distributed computing, and their integrated usage permits the benefits of both to be exploited. While much work in th...
Seng Wai Loke
198
Voted
WISE
2005
Springer
16 years 9 days ago
Scalable Instance Retrieval for the Semantic Web by Approximation
Abstract. Approximation has been identified as a potential way of reducing the complexity of logical reasoning. Here we explore approximation for speeding up instance retrieval in...
Holger Wache, Perry Groot, Heiner Stuckenschmidt