Sciweavers

367 search results - page 22 / 74
» A Rewriting Logic Sampler
Sort
View
IJCAI
2003
13 years 9 months ago
Recycling Computed Answers in Rewrite Systems for Abduction
In rule-based systems, goal-oriented computations correspond naturally to the possible ways that an observation may be explained. In some applications, we need to compute explanat...
Fangzhen Lin, Jia-Huai You
MEMOCODE
2003
IEEE
14 years 1 months ago
Executable Computational Logics: Combining Formal Methods and Programming Language Based System Design
An executable computational logic can provide the desired bridge between formal system properties and formal methods to verify them on the one hand, and executable models of syste...
José Meseguer
ICALP
1990
Springer
14 years 1 days ago
Term Rewriting Systems: From Church-Rosser to Knuth-Bendix and Beyond
Termrewritingsystemsare importantfor computabilitytheoryof abstractdata types,for automatictheorem proving, and for the foundationsof functionalprogramming.In this shortsurveywe pr...
Jan Willem Klop
ENTCS
2006
146views more  ENTCS 2006»
13 years 8 months ago
Relating State-Based and Process-Based Concurrency through Linear Logic
This paper has the purpose of reviewing some of the established relationships between logic and concurrency, and of exploring new ones. Concurrent and distributed systems are noto...
Iliano Cervesato, Andre Scedrov
ATAL
2006
Springer
13 years 11 months ago
Prototyping 3APL in the Maude term rewriting language
Abstract. This paper presents an implementation of (a simplified version of) the cognitive agent programming language 3APL in the Maude term rewriting language. Maude is based on t...
M. Birna van Riemsdijk, Frank S. de Boer, Mehdi Da...