Sciweavers

226 search results - page 28 / 46
» Extensional Theories and Rewriting
Sort
View
FORTE
2010
13 years 10 months ago
Grouping Nodes in Wireless Sensor Networks Using Coalitional Game Theory
Wireless sensor networks are typically ad-hoc networks of resource-constrained nodes; in particular, the nodes are limited in power resources. It can be difficult and costly to rep...
Fatemeh Kazemeyni, Einar Broch Johnsen, Olaf Owe, ...
MM
1996
ACM
168views Multimedia» more  MM 1996»
14 years 29 days ago
Do Story Agents Use Rocking Chairs? The Theory and Implementation of One Model for Computational Narrative
Narrative structure models are useful tools for understanding how and why narratives of any medium affect an audience's level of participation in their role of story reconstr...
Kevin M. Brooks
LISP
2008
105views more  LISP 2008»
13 years 8 months ago
Proving operational termination of membership equational programs
Abstract Reasoning about the termination of equational programs in sophisticated equational languages such as ELAN, MAUDE, OBJ, CAFEOBJ, HASKELL, and so on, requires support for ad...
Francisco Durán, Salvador Lucas, Claude Mar...
PEPM
2010
ACM
13 years 10 months ago
A3PAT, an approach for certified automated termination proofs
Software engineering, automated reasoning, rule-based programming or specifications often use rewriting systems for which termination, among other properties, may have to be ensur...
Evelyne Contejean, Andrey Paskevich, Xavier Urbain...
CADE
2011
Springer
12 years 8 months ago
Experimenting with Deduction Modulo
Deduction modulo is a generic framework to describe proofs in a theory better than using raw axioms. This is done by presenting the theory through rules rewriting terms and proposi...
Guillaume Burel