Sciweavers

140 search results - page 16 / 28
» On Expressive Number Restrictions in Description Logics
Sort
View
LFCS
2009
Springer
14 years 2 months ago
Completeness Results for Memory Logics
Memory logics are a family of modal logics in which standard relational structures are augmented with data structures and additional operations to modify and query these structure...
Carlos Areces, Santiago Figueira, Sergio Mera
VLSISP
2008
140views more  VLSISP 2008»
13 years 7 months ago
Regular Expression Matching in Reconfigurable Hardware
In this paper we describe a regular expression pattern matching approach for reconfigurable hardware. Following a Non-deterministic Finite Automata direction, we introduce three ne...
Ioannis Sourdis, João Bispo, João M....
EWSA
2005
Springer
14 years 1 months ago
Architecture Description for Mobile Distributed Systems
Abstract. In this paper we motivate an Architecture Description Language (ADL) for mobile distributed systems based on the π-calculus. Different from other approaches, the non-fu...
Volker Gruhn, Clemens Schäfer
ICLP
2004
Springer
14 years 1 months ago
MProlog: An Extension of Prolog for Modal Logic Programming
We introduce our implemented modal logic programming system MProlog. This system is written in Prolog as a module for Prolog. Codes, libraries, and most features of Prolog can be u...
Linh Anh Nguyen
DLOG
2001
13 years 9 months ago
Using Lazy Unfolding for the Computation of Least Common Subsumers
For description logics with existential restrictions, the size of the least common subsumer (lcs) of concept descriptions may grow exponentially in the size of the concept descrip...
Anni-Yasmin Turhan, Ralf Molitor