Sciweavers

1700 search results - page 152 / 340
» Specifying and implementing refactorings
Sort
View
CLIMA
2004
15 years 6 months ago
A Computational Model for Conversation Policies for Agent Communication
In this paper we propose a formal specification of a persuasion protocol between autonomous agents using an approach based on social commitments and arguments. In order to be flexi...
Jamal Bentahar, Bernard Moulin, John-Jules Ch. Mey...
COMMA
2006
15 years 6 months ago
Towards Representing and Querying Arguments on the Semantic Web
This paper demonstrates the potential of the Semantic Web as a platform for representing, navigating and processing arguments on a global scale. We use the RDF Schema (RDFS) ontolo...
Iyad Rahwan, P. V. Sakeer
142
Voted
FIMI
2004
239views Data Mining» more  FIMI 2004»
15 years 6 months ago
LCM ver. 2: Efficient Mining Algorithms for Frequent/Closed/Maximal Itemsets
: For a transaction database, a frequent itemset is an itemset included in at least a specified number of transactions. A frequent itemset P is maximal if P is included in no other...
Takeaki Uno, Masashi Kiyomi, Hiroki Arimura
FLAIRS
2001
15 years 6 months ago
Validity of First-Order Knowledge Bases
A knowledge base is maintained by modifying its conceptual model and by using those modifications to specify changes to its implementation. The maintenance problem is to determine...
John K. Debenham
IJCAI
2001
15 years 6 months ago
IBAL: A Probabilistic Rational Programming Language
In a rational programming language, a program specifies a situation faced by an agent; evaluating the program amounts to computing what a rational agent would believe or do in the...
Avi Pfeffer