725 search results - page 105 / 145 » Complexity of Computing with Extended Propositional Logic Pr... |
148
Voted
COMMA
2010
14 years 9 months ago
2010
Abstract. Constrained argumentation frameworks (CAF) generalize Dung's frameworks by allowing additional constraints on arguments to be taken into account in the definition of...
129
Voted
AAAI
2006
15 years 3 months ago
2006
Interactive configurators are decision support systems assisting users in selecting values for parameters that respect given constraints. The underlying knowledge can be convenien...
98
Voted
LICS
2007
IEEE
15 years 8 months ago
2007
IEEE
FreshML extends ML with constructs for declaring and ting abstract syntax trees that involve names and statically scoped binders. It is impure: name generation is an observable si...
107
click to vote
ICCAD
2010
IEEE
15 years 15 days ago
2010
IEEE
Boolean matching for multiple-output functions determines whether two given (in)completely-specified function vectors can be identical to each other under permutation and/or negat...
148
Voted
CORR
2008
Springer
15 years 2 months ago
2008
Springer
The practical realization of managing and executing large scale scientific computations efficiently and reliably is quite challenging. Scientific computations often invo...