Sciweavers

4266 search results - page 506 / 854
» A Framework for Defining Logics
Sort
View
202
Voted
ICCS
2010
Springer
15 years 5 months ago
Default Conceptual Graph Rules, Atomic Negation and Tic-Tac-Toe
Abstract. In this paper, we explore the expressivity of default CG rules (a CGoriented subset of Reiter’s default logics) through two applications. In the first one, we show tha...
Jean-François Baget, Jérôme Fo...
175
Voted
IRFC
2010
Springer
15 years 4 months ago
An Information Retrieval Model Based on Discrete Fourier Transform
Abstract. Information Retrieval (IR) systems combine a variety of techniques stemming from logical, vector-space and probabilistic models. This variety of combinations has produced...
Alberto Costa, Massimo Melucci
185
Voted
ECSQARU
2009
Springer
15 years 4 months ago
Soft Constraints Processing over Divisible Residuated Lattices
We claim that divisible residuated lattices (DRLs) can act as a unifying evaluation framework for soft constraint satisfaction problems (soft CSPs). DRLs form the algebraic semanti...
Simone Bova
IJAC
2010
231views more  IJAC 2010»
15 years 4 months ago
Descriptive Complexity of Finite Abelian Groups
Title of dissertation: MODEL THEORY AND COMPLEXITY THEORY Walid Gomaa Doctor of Philosophy, 2007 Dissertation directed by: Professor William Gasarch Department of Computer Science...
Walid Gomaa
170
Voted
ICML
2004
IEEE
16 years 7 months ago
Bellman goes relational
Motivated by the interest in relational reinforcement learning, we introduce a novel relational Bellman update operator called ReBel. It employs a constraint logic programming lan...
Kristian Kersting, Martijn Van Otterlo, Luc De Rae...