Sciweavers

565 search results - page 65 / 113
» Extending Answer Sets for Logic Programming Agents
Sort
View
ESAW
2006
Springer
13 years 11 months ago
Competence Checking for the Global E-Service Society Using Games
Abstract. We study the problem of checking the competence of communicative agents operating in a global society in order to receive and offer electronic services. Such a society wi...
Kostas Stathis, George Lekeas, Christos Kloukinas
CLIMA
2004
13 years 9 months ago
Verifying Protocol Conformance for Logic-Based Communicating Agents
Communication plays a fundamental role in multi-agents systems. One of the main issues in the design of agent interaction protocols is the verification that a given protocol implem...
Matteo Baldoni, Cristina Baroglio, Alberto Martell...
CONCUR
2005
Springer
14 years 1 months ago
A New Modality for Almost Everywhere Properties in Timed Automata
The context of this study is timed temporal logics for timed automata. In this paper, we propose an extension of the classical logic TCTL with a new Until modality, called “Until...
Houda Bel Mokadem, Béatrice Bérard, ...
RULEML
2005
Springer
14 years 1 months ago
Extending the SweetDeal Approach for e-Procurement Using SweetRules and RuleML
We show the first detailed realistic e-business application scenario that uses and exploits capabilities of the SweetRules V2.1 toolset for e-contracting using the SweetDeal approa...
Sumit Bhansali, Benjamin N. Grosof
CEC
2011
IEEE
12 years 8 months ago
Cost-benefit analysis of using heuristics in ACGP
—Constrained Genetic Programming (CGP) is a method of searching the Genetic Programming search space non-uniformly, giving preferences to certain subspaces according to some heur...
John W. Aleshunas, Cezary Z. Janikow