2214 search results - page 224 / 443 » Complexity of Reasoning |
177
Voted
CP
2005
Springer
16 years 17 days ago
2005
Springer
Many problems of theoretical and practical interest can be formulated as Constraint Satisfaction Problems (CSPs). The general CSP is known to be NP-complete; however, distributed m...
190
Voted
DALT
2005
Springer
16 years 17 days ago
2005
Springer
Existing cognitive agent programming languages that are based on the BDI model employ logical representation and reasoning for implementing the beliefs of agents. In these programm...
186
Voted
SAS
2005
Springer
16 years 15 days ago
2005
Springer
A technique for generating invariant polynomial inequalities of bounded degree is presented using the abstract interpretation framework. It is based on overapproximating basic semi...
190
Voted
TARK
2005
Springer
16 years 15 days ago
2005
Springer
s for Multi-Agent Only Knowing (extended abstract) Arild Waaler1,2 and Bjørnar Solhaug3,4 1 Finnmark College, Norway 2 Dep. of Informatics, University of Oslo, Norway 3 SINTEF ICT...
154
click to vote
SIGCSE
2004
ACM
16 years 14 days ago
2004
ACM
An important question that must be addressed in a coherent computing curriculum is which programming environments to use across the curriculum. For Java, currently the most widely...