177 search results - page 18 / 36 » Reducing the complexity of logics for multiagent systems |
FLOPS
2004
Springer
15 years 5 months ago
2004
Springer
We present a graphical tool for the declarative debugging of wrong answers in functional-logic languages. The tool, integrated in the system T OY, can be used to navigate a computa...
142
click to vote
CSL
2007
Springer
15 years 6 months ago
2007
Springer
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ï...
120
click to vote
JLP
2007
14 years 11 months ago
2007
This work faces the problem of web service selection and composition, discussing the advantages that derive from the inclusion, in a web service declarative description, of the hi...
111
click to vote
AISADM
2005
Springer
15 years 5 months ago
2005
Springer
Computer programming of complex systems is a time consuming effort. Results are often brittle and inflexible. Evolving, self-learning flexible multi-agent systems remain a distant ...
109
click to vote
IV
2005
IEEE
15 years 5 months ago
2005
IEEE
Visualising large graphs faces the challenges of both data complexity and visual complexity. This paper presents a framework for visualising large graphs that reduces data complex...