The focus of process calculi is interaction rather than computation, and for this very reason: (i) their operational semantics is conveniently expressed by labelled transition syst...
Conditional deduction in binary logic basically consists of deriving new statements from an existing set of statements and conditional rules. Modus Ponens, which is the classical e...
Any finite tree automaton (or regular type) can be used to construct act interpretation of a logic program, by first determinising and completing the automaton to get a pre-inter...
John P. Gallagher, Kim S. Henriksen, Gourinath Ban...
Abstract. In recent work, a general framework for specifying program correspondences under the answer-set semantics has been defined. The framework allows to define different not...
The Semantic Web is a rapidly growing research area aiming at the exchange of semantic information over the World Wide Web. The Semantic Web is built on top of RDF, an XML-based ex...