Sciweavers

1948 search results - page 263 / 390
» Formalizing Mirror Theory
Sort
View
143
Voted
CORR
2000
Springer
133views Education» more  CORR 2000»
15 years 5 months ago
On Exponential-Time Completeness of the Circularity Problem for Attribute Grammars
Attribute grammars (AGs) are a formal technique for defining semantics of programming languages. Existing complexity proofs on the circularity problem of AGs are based on automata...
Pei-Chi Wu
JSC
2000
117views more  JSC 2000»
15 years 5 months ago
Goals and Benchmarks for Automated Map Reasoning
Tarski-Givant's map calculus is briefly reviewed, and a plan of research is outlined aimed at investigating applications of this ground equational formalism in the theorem-pr...
Andrea Formisano, Eugenio G. Omodeo, Marco Temperi...
ETAI
1998
99views more  ETAI 1998»
15 years 5 months ago
A Logical Account of the Common Sense Informatic Situation for a Mobile Robot
Any model of the world a robot constructs on the basis of its sensor data is necessarily both incomplete, due to the robot’s limited window on the world, and uncertain, due to s...
Murray Shanahan
ML
2007
ACM
15 years 5 months ago
Status report: specifying javascript with ML
The Ecma TC39-TG1 working group is using ML as the specification language for the next generation of JavaScript, the popular programming language for browser-based web applicatio...
David Herman, Cormac Flanagan
MTA
2010
118views more  MTA 2010»
15 years 4 months ago
A computation-oriented multimedia data streams model for content-based information retrieval
: Multimedia applications nowadays are becoming prevalent. In the past the relational database model was generalized to the multimedia database model. More recently the relational ...
Shi-Kuo Chang, Lei Zhao, Shenoda Guirguis, Rohit K...