Sciweavers

917 search results - page 169 / 184
» On the Semantics of Updates in a Functional Language
Sort
View
CAV
1999
Springer
119views Hardware» more  CAV 1999»
13 years 12 months ago
A Theory of Restrictions for Logics and Automata
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...
Nils Klarlund
AAAI
2007
13 years 10 months ago
Learning by Reading: A Prototype System, Performance Baseline and Lessons Learned
A traditional goal of Artificial Intelligence research has been a system that can read unrestricted natural language texts on a given topic, build a model of that topic and reason...
Ken Barker, Bhalchandra Agashe, Shaw Yi Chaw, Jame...
DAC
2006
ACM
14 years 8 months ago
Formal analysis of hardware requirements
Formal languages are increasingly used to describe the functional requirements (specifications) of circuits. These requirements are used as a means to communicate design intent an...
Ingo Pill, Simone Semprini, Roberto Cavada, Marco ...
ER
2007
Springer
127views Database» more  ER 2007»
14 years 1 months ago
Generic Schema Mappings
Schema mappings come in different flavors: simple correspondences are produced by schema matchers, intensional mappings are used for schema integration. However, the execution of ...
David Kensche, Christoph Quix, Yong Li, Matthias J...
CA
2002
IEEE
14 years 18 days ago
Representing and Parameterizing Agent Behaviors
The last few years have seen great maturation in understanding how to use computer graphics technology to portray 3D embodied characters or virtual humans. Unlike the off-line, an...
Norman I. Badler, Jan M. Allbeck, Liwei Zhao, Meer...