Sciweavers

780 search results - page 73 / 156
» Reasoning about sets using redescription mining
Sort
View
162
Voted
ICLP
2004
Springer
15 years 10 months ago
Possible Worlds Semantics for Probabilistic Logic Programs
Abstract. In this paper we consider a logic programming framework for reasoning about imprecise probabilities. In particular, we propose a new semantics, for the Probabilistic Logi...
Alex Dekhtyar, Michael I. Dekhtyar
SDM
2007
SIAM
176views Data Mining» more  SDM 2007»
15 years 6 months ago
Adaptive Concept Learning through Clustering and Aggregation of Relational Data
We introduce a new approach for Clustering and Aggregating Relational Data (CARD). We assume that data is available in a relational form, where we only have information about the ...
Hichem Frigui, Cheul Hwang
HASKELL
2009
ACM
15 years 12 months ago
A compositional theory for STM Haskell
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
Johannes Borgström, Karthikeyan Bhargavan, An...
PLDI
2011
ACM
14 years 8 months ago
Separation logic + superposition calculus = heap theorem prover
Program analysis and verification tools crucially depend on the ability to symbolically describe and reason about sets of program behaviors. Separation logic provides a promising...
Juan Antonio Navarro Pérez, Andrey Rybalche...
CNL
2009
15 years 6 months ago
Rhetorical Compositions for Controlled Natural Languages
Logic-based controlled natural languages usually provide some facility for compositional representation, minimally including sentence level coordination and sometimes subordination...
Andrew Potter