Sciweavers

492 search results - page 31 / 99
» Simplifying Probabilistic Programs Using Computer Algebra
Sort
View
109
Voted
ACL
2012
13 years 1 months ago
Learning to "Read Between the Lines" using Bayesian Logic Programs
Most information extraction (IE) systems identify facts that are explicitly stated in text. However, in natural language, some facts are implicit, and identifying them requires ...
Sindhu Raghavan, Raymond J. Mooney, Hyeonseo Ku
103
Voted
LOGCOM
2010
152views more  LOGCOM 2010»
14 years 5 months ago
Constructive Logic with Strong Negation as a Substructural Logic
Gentzen systems are introduced for Spinks and Veroff's substructural logic corresponding to constructive logic with strong negation, and some logics in its vicinity. It has b...
Manuela Busaniche, Roberto Cignoli
79
Voted
EMSOFT
2004
Springer
15 years 4 months ago
Conservative approximations for heterogeneous design
Embedded systems are electronic devices that function in the context of a real environment, by sensing and reacting to a set of stimuli. Because of their close interaction with th...
Roberto Passerone, Jerry R. Burch, Alberto L. Sang...
BTW
2007
Springer
142views Database» more  BTW 2007»
15 years 5 months ago
Algebraic Query Optimization for Distributed Top-k Queries
: Distributed top-k query processing is increasingly becoming an essential functionality in a large number of emerging application classes. This paper addresses the efficient alge...
Thomas Neumann, Sebastian Michel
93
Voted
CADE
2007
Springer
15 years 11 months ago
Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
Viktor Kuncak, Martin C. Rinard