4617 search results - page 336 / 924 » Automation of Diagrammatic Reasoning |
218
click to vote
ICLP
2011
Springer
14 years 10 months ago
2011
Springer
Parallel implementations of programming languages need to control synchronization overheads. Synchronization is essential for ensuring the correctness of parallel code, yet it add...
243
click to vote
ICLP
2011
Springer
14 years 10 months ago
2011
Springer
In high-level constraint modelling languages, constraints can occur in non-Boolean contexts: implicitly, in the form of partial functions, or more explicitly, in the form of const...
208
click to vote
LPAR
2012
Springer
14 years 2 months ago
2012
Springer
E-matching is the most commonly used technique to handle quantifiers in SMT solvers. It works by identifying characteristic subexpressions of quantified formulae, named triggers,...
228
click to vote
CL
2012
Springer
13 years 9 months ago
2012
Springer
Distributed logic programming languages, that allow both facts and programs to be distributed among different nodes in a network, have been recently proposed and used to declarati...
188
click to vote
CAV
2012
Springer
13 years 9 months ago
2012
Springer
Abstract. A minimum satisfying assignment of a formula is a minimumcost partial assignment of values to the variables in the formula that guarantees the formula is true. Minimum sa...