3729 search results - page 124 / 746 » On Formal Modeling of Agent Computations |
146
click to vote
AAAI
2006
15 years 7 months ago
2006
Model counting is the classical problem of computing the number of solutions of a given propositional formula. It vastly generalizes the NP-complete problem of propositional satis...
149
click to vote
ICLP
1990
Springer
15 years 10 months ago
1990
Springer
The logic programming language framework Kernel Andorra Prolog is de ned by a formal computation model. In Kernel Andorra Prolog, general combinations of concurrent reactive langu...
206
click to vote
CIA
2007
Springer
16 years 16 days ago
2007
Springer
Abstract. We present a trust model extension that attempts to relax the assumptions that are currently taken by the majority of existing trust models: (i) proven identity of agents...
192
click to vote
KBSE
1995
IEEE
15 years 10 months ago
1995
IEEE
Cost-effective engineering and evolution of complex software must involve the different stakeholders concurrently and collaboratively. The hard problem is providing computer suppo...
217
click to vote
ICCS
1999
Springer
15 years 10 months ago
1999
Springer
Conceptual Graphs and Formal Concept Analysis have in common basic concerns: the focus on conceptual structures, the use of diagrams for supporting communication, the orientation b...