Sciweavers

1269 search results - page 78 / 254
» Pi-Calculus in Logical Form
Sort
View
100
Voted
DLOG
2008
15 years 2 months ago
Rewriting Rules into SROIQ Axioms
Description Logics are a family of very expressive logics but some forms of knowledge are much more intuitive to formulate otherwise, say, as rules. Rules in DL can be dealt with t...
Francis Gasse, Ulrike Sattler, Volker Haarslev
103
Voted
AAECC
2010
Springer
114views Algorithms» more  AAECC 2010»
15 years 22 days ago
Termination of narrowing via termination of rewriting
Abstract Narrowing extends rewriting with logic capabilities by allowing logic variables in terms and by replacing matching with unification. Narrowing has been widely used in diff...
Naoki Nishida, Germán Vidal
102
Voted
ENTCS
2006
90views more  ENTCS 2006»
15 years 19 days ago
A Framework for Engineering Interactions in Java-based Component Systems
This paper describes a Java-based framework for the development of componentbased software systems supporting the specification of the logic of component interactions as a first-c...
Antonio Natali, Enrico Oliva, Alessandro Ricci, Mi...
JAPLL
2008
76views more  JAPLL 2008»
15 years 18 days ago
The many faces of counts-as: A formal analysis of constitutive rules
Abstract. The paper proposes a logical systematization of the notion of countsas which is grounded on a very simple intuition about what counts-as statements actually mean, i.e., f...
Davide Grossi, John-Jules Ch. Meyer, Frank Dignum
126
Voted
POPL
2012
ACM
13 years 8 months ago
Higher-order functional reactive programming in bounded space
Functional reactive programming (FRP) is an elegant and successful approach to programming reactive systems declaratively. The high levels of abstraction and expressivity that mak...
Neelakantan R. Krishnaswami, Nick Benton, Jan Hoff...