Sciweavers

2152 search results - page 299 / 431
» On Automating the Calculus of Relations
Sort
View
103
Voted
ICT
2004
Springer
143views Communications» more  ICT 2004»
15 years 6 months ago
A Generic Event-Driven System for Managing SNMP-Enabled Communication Networks
In the area of monitoring communication networks, GEDSystem is a tool for supporting the development of programs driven to the management of domains that may show up when networks ...
Aécio Paiva Braga, Riverson Rios, Rossana M...
104
Voted
ISCIS
2004
Springer
15 years 6 months ago
Correctness Requirements for Multiagent Commitment Protocols
Abstract. Commitments are a powerful abstraction for representing the interactions between agents. Commitments capture the content of the interactions declaratively and allow agent...
Pinar Yolum
KR
2004
Springer
15 years 6 months ago
Improving the Forward Chaining Algorithm for Conceptual Graphs Rules
Simple Conceptual Graphs (SGs) are used to represent entities and relations between these entities: they can be translated into positive, conjunctive, existential first-order log...
Jean-François Baget
LOPSTR
2004
Springer
15 years 6 months ago
Proving Termination for Logic Programs by the Query-Mapping Pairs Approach
This paper describes a method for proving termination of to logic programs based on abstract interpretation. The method ry-mapping pairs to abstract the relation between calls in t...
Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Ser...
NMR
2004
Springer
15 years 6 months ago
Logic programs with annotated disjunctions
Current literature offers a number of different approaches to what could generally be called “probabilistic logic programming”. These are usually based on Horn clauses. Here, ...
Joost Vennekens, Sofie Verbaeten, Maurice Bruynoog...