4217 search results - page 752 / 844 » Computational indistinguishability logic |
SERP
2007
14 years 11 months ago
2007
– The use of design patterns such as the GRASP (General Responsibility Assignment Software Principles) or GoF (Gang-of-Four) patterns in software engineering has been well-docume...
100
click to vote
AAAI
2006
14 years 11 months ago
2006
Recent research shows that SAT (propositional satisfiability) techniques can be employed to build efficient systems to compute answer sets for logic programs. ASSAT and CMODELS ar...
AIPS
2006
14 years 11 months ago
2006
Planning for partially observable, nondeterministic domains is a very signi cant and computationally hard problem. Often, reasonable assumptions can be drawn over expected/nominal...
128
click to vote
CLIMA
2006
14 years 11 months ago
2006
We present a multi-agent formalism based on extended answer set programming. The system consists of independent agents connected via a communication channel, where knowledge and be...
DAGSTUHL
2004
14 years 11 months ago
2004
Although computer systems penetrate all facets of society, the software running those systems may contain many errors. Producing high quality software appears to be difficult and v...