Sciweavers

129 search results - page 22 / 26
» Revisiting Abstract Argumentation Frameworks
Sort
View
ML
2008
ACM
150views Machine Learning» more  ML 2008»
15 years 4 months ago
Learning probabilistic logic models from probabilistic examples
Abstract. We revisit an application developed originally using Inductive Logic Programming (ILP) by replacing the underlying Logic Program (LP) description with Stochastic Logic Pr...
Jianzhong Chen, Stephen Muggleton, José Car...
TSP
2010
14 years 11 months ago
MIMO transceiver optimization with linear constraints on transmitted signal covariance components
Abstract--This correspondence revisits the joint transceiver optimization problem for multiple-input multiple-output (MIMO) channels. The linear transceiver as well as the transcei...
Ching-Chih Weng, P. P. Vaidyanathan
FSTTCS
2008
Springer
15 years 5 months ago
Sound Lemma Generation for Proving Inductive Validity of Equations
ABSTRACT. In many automated methods for proving inductive theorems, finding a suitable generalization of a conjecture is a key for the success of proof attempts. On the other hand...
Takahito Aoto
IDC
2009
Springer
15 years 11 months ago
A Trusted Defeasible Reasoning Service for Brokering Agents in the Semantic Web
Abstract. Based on the plethora of proposals and standards for logic- and rulebased reasoning for the Semantic Web (SW), a key factor for the success of SW agents is interoperabili...
Kalliopi Kravari, Efstratios Kontopoulos, Nick Bas...
ICALP
2005
Springer
15 years 10 months ago
Up-to Techniques for Weak Bisimulation
Abstract. We study the use of the elaboration preorder (due to ArunKumar and Natarajan) in the framework of up-to techniques for weak bisimulation. We show that elaboration yields ...
Damien Pous