4617 search results - page 549 / 924 » Automation of Diagrammatic Reasoning |
210
click to vote
CADE
2004
Springer
16 years 8 months ago
2004
Springer
LRR [3] is a rewriting system developed at the Computer Science Department of University of Houston. LRR has two subsystems: Smaran (for tabled rewriting), and TGR (for untabled re...
169
click to vote
CADE
2003
Springer
16 years 8 months ago
2003
Springer
We make the notion of scope in the -calculus explicit. To that end, the syntax of the -calculus is extended with an end-of-scope operator , matching the usual opening of a scope du...
175
click to vote
CADE
2002
Springer
16 years 8 months ago
2002
Springer
Decision procedures for combinations of theories are at the core of many modern theorem provers such as ACL2, Ehdm, PVS, SIMPLIFY, the Stanford Pascal Verifier, STeP, SVC, and Z/Ev...
258
click to vote
TIME
2009
IEEE
16 years 2 months ago
2009
IEEE
—Past research on temporal databases has primarily focused on state-based representations and on relational query language extensions for such representations. This led to many d...
325
Voted
TIME
2009
IEEE
16 years 2 months ago
2009
IEEE
—Rule-based filters are sequences of rules formed of a condition and a decision. Rules are applied sequentially up to the first fulfilled condition, whose matching decision de...