193 search results - page 6 / 39 » Partial Solutions with Unique Completion |
PLDI
2010
ACM
14 years 4 months ago
2010
ACM
Synthesis of program fragments from specifications can make programs easier to write and easier to reason about. To integrate synthesis into programming languages, synthesis algor...
CALCO
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Completely iterative algebras (cias) are those algebras in which recursive equations have unique solutions. In this paper we study complete iterativity for algebras with ...
AAAI
2008
13 years 9 months ago
2008
Usually a voting rule requires agents to give their preferences as linear orders. However, in some cases it is impractical for an agent to give a linear order over all the alterna...
ICTAI
2010
IEEE
13 years 5 months ago
2010
IEEE
A significant body of work in multiagent systems over more than two decades has focused on multi-agent coordination (1). Many challenges in multi-agent coordination can be modeled ...
ICNC
2005
Springer
14 years 29 days ago
2005
Springer
In completeness theories of multiple-valued logic, the characterization of Sheffer functions is an important problem，and the solution can be reduced to determining the minimal co...