Sciweavers

4192 search results - page 717 / 839
» Probabilistic Logic Programming
Sort
View
136
Voted
FOIKS
2008
Springer
15 years 4 months ago
Defeasible Reasoning and Partial Order Planning
Abstract. Argumentation-based formalisms provide a way of considering the defeasible nature of reasoning with partial and often erroneous knowledge in a given environment. This pro...
Diego R. García, Alejandro Javier Garc&iacu...
112
Voted
AMW
2010
15 years 3 months ago
Query Rewriting under Non-Guarded Rules
We address the problem of answering conjunctive queries over knowledge bases, specified by sets of first-order sentences called tuple-generating dependencies (TGDs). This problem i...
Andrea Calì, Georg Gottlob, Andreas Pieris
127
Voted
FORTE
2007
15 years 3 months ago
Specifying and Composing Interaction Protocols for Service-Oriented System Modelling
Abstract. We present and discuss a formal, high-level approach to the specification and composition of interaction protocols for service-oriented systems. This work is being develo...
João Abreu, Laura Bocchi, José Luiz ...
CASCON
2004
108views Education» more  CASCON 2004»
15 years 3 months ago
Consistent query answering under inclusion dependencies
For several reasons a database may not satisfy certain integrity constraints (ICs), for example, when it is the result of integrating several independent data sources. However, mo...
Loreto Bravo, Leopoldo E. Bertossi
CLIMA
2004
15 years 3 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...