Sciweavers

2308 search results - page 84 / 462
» Representing Symbolic Reasoning
Sort
View
SIGCSE
2005
ACM
117views Education» more  SIGCSE 2005»
15 years 12 months ago
Design patterns for parsing
We provide a systematic transformation of an LL(1) grammar to an object model that consists of · an object structure representing the non-terminal symbols and their corresponding...
Dung Zung Nguyen, Mathias Ricken, Stephen B. Wong
CAV
2001
Springer
83views Hardware» more  CAV 2001»
15 years 10 months ago
Iterating Transducers
Regular languages have proved useful for the symbolic state exploration of infinite state systems. They can be used to represent infinite sets of system configurations; the tran...
Dennis Dams, Yassine Lakhnech, Martin Steffen
JOT
2008
136views more  JOT 2008»
15 years 6 months ago
The Stock Statistics Parser
This paper describes how use the HTMLEditorKit to perform web data mining on stock statistics for listed firms. Our focus is on making use of the web to get information about comp...
Douglas Lyon
POPL
2010
ACM
16 years 3 months ago
A simple, verified validator for software pipelining
Software pipelining is a loop optimization that overlaps the execution of several iterations of a loop to expose more instruction-level parallelism. It can result in first-class p...
Jean-Baptiste Tristan, Xavier Leroy
SEMWEB
2005
Springer
15 years 11 months ago
Decentralized Case-Based Reasoning for the Semantic Web
Abstract. Decentralized case-based reasoning (DzCBR) is a reasoning framework that addresses the problem of adaptive reasoning in a multi-ontology environment. It is a case-based r...
Mathieu d'Aquin, Jean Lieber, Amedeo Napoli