271 search results - page 12 / 55 » A comparison between two logical formalisms for rewriting |
201
Voted
POPL
2003
ACM
16 years 23 days ago
2003
ACM
We introduce a new framework of algebraic pure type systems in which we consider rewrite rules as lambda terms with patterns and rewrite rule application as abstraction applicatio...
91
Voted
FSTTCS
2008
Springer
15 years 1 months ago
2008
Springer
ABSTRACT. Formalisms involving some degree of nondeterminism are frequent in computer science. In particular, various programming or specification languages are based on term rewr...
132
Voted
AI
2010
Springer
15 years 18 days ago
2010
Springer
We develop a formal framework for comparing different versions of ontologies, and apply it to ontologies formulated in terms of DL-Lite, a family of `lightweight' description...
108
click to vote
LPNMR
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. Nested logic programs and epistemic logic programs are two important extensions of answer set programming. However, the relationship between these two formalisms is rarel...
TLCA
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. This paper proposes two typing systems for session interactions in higherorder mobile processes. Session types for the HOπ-calculus capture high-level structures nicatio...