Sciweavers

6829 search results - page 1126 / 1366
» Quantitative Generalizations of Languages
Sort
View
TACAS
2000
Springer
151views Algorithms» more  TACAS 2000»
15 years 7 months ago
Salsa: Combining Constraint Solvers with BDDs for Automatic Invariant Checking
Salsa is an invariant checker for speci cations in SAL the SCR Abstract Language. To establish a formula as an invariant without any user guidance Salsa carries out an induction pr...
Ramesh Bharadwaj, Steve Sims
ICLP
1995
Springer
15 years 7 months ago
Using Attributed Variables in the Implementation of Concurrent and Parallel Logic Programming Systems
Incorporating the possibility of attaching attributes to variables in a logic programming system has been shown to allow the addition of general constraint solving capabilities to...
Manuel V. Hermenegildo, Daniel Cabeza Gras, Manuel...
VLDB
1991
ACM
126views Database» more  VLDB 1991»
15 years 7 months ago
Deriving Production Rules for Incremental View Maintenance
It is widely recognized that production rules in database systems can be used to automatically maintain derived data such as views. However, writing a correct set of rules for e ci...
Stefano Ceri, Jennifer Widom
EDBT
2010
ACM
144views Database» more  EDBT 2010»
15 years 7 months ago
Timely YAGO: harvesting, querying, and visualizing temporal knowledge from Wikipedia
Recent progress in information extraction has shown how to automatically build large ontologies from high-quality sources like Wikipedia. But knowledge evolves over time; facts ha...
Yafang Wang, Mingjie Zhu, Lizhen Qu, Marc Spaniol,...
FOSSACS
2010
Springer
15 years 7 months ago
Untyped Recursion Schemes and Infinite Intersection Types
A new framework for higher-order program verification has been recently proposed, in which higher-order functional programs are modelled as higher-order recursion schemes and then ...
Takeshi Tsukada, Naoki Kobayashi
« Prev « First page 1126 / 1366 Last » Next »