Sciweavers

393 search results - page 63 / 79
» Probabilistic Description Logic Programs
Sort
View
CPAIOR
2008
Springer
13 years 9 months ago
Stochastic Satisfiability Modulo Theories for Non-linear Arithmetic
Abstract. The stochastic satisfiability modulo theories (SSMT) problem is a generalization of the SMT problem on existential and randomized (aka. stochastic) quantification over di...
Tino Teige, Martin Fränzle
JOT
2010
144views more  JOT 2010»
13 years 5 months ago
A Tool for Specifying and Validating Agents' Interaction Protocols: From Agent UML to Maude
To achieve the multi-agent systems’ goals, agents interact to exchange information, to cooperate and to coordinate their tasks. Interaction is generally recognized as an importa...
Farid Mokhati, Brahim Sahraoui, Soufiane Bouzaher,...
EACL
1993
ACL Anthology
13 years 8 months ago
A Strategy for Dynamic Interpretation: a Fragment and an Implementation
The strategy for natural language interpretation presented in this paper implements the dynamics of context change by translating natural language texts into a meaning representat...
Olivier Bouchez, Jan van Eijck, Olivier Istace
CORR
2007
Springer
126views Education» more  CORR 2007»
13 years 7 months ago
Linear Tabling Strategies and Optimizations
Recently there has been a growing interest of research in tabling in the logic programming community because of its usefulness in a variety of application domains including progra...
Neng-Fa Zhou, Taisuke Sato, Yi-Dong Shen
PODS
2008
ACM
174views Database» more  PODS 2008»
14 years 7 months ago
Epistemic privacy
We present a novel definition of privacy in the framework of offline (retroactive) database query auditing. Given information about the database, a description of sensitive data, ...
Alexandre V. Evfimievski, Ronald Fagin, David P. W...