Sciweavers

189 search results - page 31 / 38
» Similarity-Guided Clause Generalization
Sort
View
LANMR
2004
14 years 11 months ago
New Semantics for Hybrid Probabilistic Programs
Hybrid probabilistic programs framework [5] is a variation of probabilistic annotated logic programming approach, which allows the user to explicitly encode the available knowledge...
Emad Saad
AAAI
2000
14 years 11 months ago
MarketSAT: An Extremely Decentralized (but Really Slow) Algorithm for Propositional Satisfiability
We describe MarketSAT, a highly decentralized, marketbased algorithm for propositional satisfiability. The approach is based on a formulation of satisfiability as production on a ...
William E. Walsh, Michael P. Wellman
VMV
2003
203views Visualization» more  VMV 2003»
14 years 11 months ago
Semantic Scene Analysis of Scanned 3D Indoor Environments
Precise digital 3D models of indoor environments are needed in several applications, e.g., facility management, architecture, rescue and inspection robotics. This paper presents a...
Andreas Nüchter, Hartmut Surmann, Kai Lingema...
APAL
2008
84views more  APAL 2008»
14 years 9 months ago
Resolution over linear equations and multilinear proofs
We develop and study the complexity of propositional proof systems of varying strength extending resolution by allowing it to operate with disjunctions of linear equations instead ...
Ran Raz, Iddo Tzameret
ENTCS
2006
189views more  ENTCS 2006»
14 years 9 months ago
Variables as Resource for Shared-Memory Programs: Semantics and Soundness
Parkinson, Bornat, and Calcagno recently introduced a logic for partial correctness in which program variables are treated as resource, generalizing earlier work based on separati...
Stephen D. Brookes