Sciweavers

206 search results - page 10 / 42
» Semantics, modularity, and rewriting logic
Sort
View
FCT
2007
Springer
15 years 3 months ago
Rewriting Systems with Data
Abstract. We introduce a uniform framework for reasoning about infinitestate systems with unbounded control structures and unbounded data domains. Our framework is based on constr...
Ahmed Bouajjani, Peter Habermehl, Yan Jurski, Miha...
63
Voted
ENTCS
2007
144views more  ENTCS 2007»
14 years 9 months ago
Partial Order Reduction for Rewriting Semantics of Programming Languages
Software model checkers are typically language-specific, require substantial development efforts, and are hard to reuse for other languages. Adding partial order reduction (POR)...
Azadeh Farzan, José Meseguer
69
Voted
TABLEAUX
1997
Springer
15 years 1 months ago
ileanTAP: An Intuitionistic Theorem Prover
We present a Prolog program that implements a sound and complete theorem prover for first-order intuitionistic logic. It is based on free-variable semantic tableaux extended by an...
Jens Otten
AAAI
2008
14 years 12 months ago
On the Decidability of Role Mappings between Modular Ontologies
Many semantic web applications require support for mappings between roles (or properties) defined in multiple independently developed ontology modules. Distributed Description Log...
Jie Bao, George Voutsadakis, Giora Slutzki, Vasant...
CADE
2006
Springer
15 years 9 months ago
Automation of Recursive Path Ordering for Infinite Labelled Rewrite Systems
Abstract. Semantic labelling is a transformational technique for proving termination of Term Rewriting Systems (TRSs). Only its variant with finite sets of labels was used so far i...
Adam Koprowski, Hans Zantema