Syntactic constraints in Koskenniemi’s Finite-State Intersection Grammar (FSIG) are logically less complex than their formalism (Koskenniemi et al., 1992) would suggest: It turn...
Description Logic Programs (dl-programs) proposed by Eiter et al. constitute an elegant yet powerful formalism for the integration of answer set programming with description logic...
Abstract. The logical and operational aspects of rewriting logic as a logical framework are tested and illustrated in detail by representing pure type systems as object logics. Mor...
— The Semantic Web can be viewed as largely about “Knowledge meets the Web”. Thus its vision includes ontologies and rules. A key requirement for the architecture of the Sema...
Tassos Venetis, Giorgos Stoilos, Giorgos B. Stamou...
A key requirement for IETF recognition of new TCP algorithms is having an independent, interoperable implementation. This paper describes our BSD-licensed implementation of H-TCP ...
Grenville J. Armitage, Lawrence Stewart, Michael W...