4126 search results - page 307 / 826 » Set based logic programming |
139
click to vote
ENTCS
2007
15 years 5 months ago
2007
The rewrite-based approach to satisfiability modulo theories consists of using generic theorem-proving strategies for first-order logic with equality. If one can prove that an i...
142
click to vote
SIGSOFT
2010
ACM
15 years 2 months ago
2010
ACM
We present Phantm, a static analyzer that uses a flowsensitive analysis to detect type errors in PHP applications. Phantm can infer types for nested arrays, and can leverage runti...
129
Voted
ORL
2008
15 years 4 months ago
2008
We discuss the almost-sure convergence of a broad class of sampling algorithms for multi-stage stochastic linear programs. We provide a convergence proof based on the finiteness o...
139
Voted
ECSQARU
2009
Springer
15 years 9 months ago
2009
Springer
Most operators for merging multiple knowledge bases (where each is a set of formulae) aim to produce a knowledge base as output that best reflects the information available in the ...
167
click to vote
ASP
2005
Springer
15 years 10 months ago
2005
Springer
The extended answer set semantics for simple logic programs, i.e. programs with only classical negation, allows for the defeat of rules to resolve contradictions. In addition, a pa...