Sciweavers

780 search results - page 33 / 156
» Reasoning about sets using redescription mining
Sort
View
AUSAI
2006
Springer
15 years 7 months ago
LPForget: A System of Forgetting in Answer Set Programming
Abstract. A novel declarative approach of forgetting in answer set programming (ASP) has been proposed recently. In this paper we report a system prototype of forgetting in ASP, ca...
Fu-Leung Cheng, Thomas Eiter, Nathan Robinson, Abd...
FOSSACS
2007
Springer
15 years 10 months ago
Polynomial Constraints for Sets with Cardinality Bounds
Abstract. Logics that can reason about sets and their cardinality bounds are useful in program analysis, program verification, databases, and knowledge bases. This paper presents ...
Bruno Marnette, Viktor Kuncak, Martin C. Rinard
CADE
2000
Springer
15 years 8 months ago
Reasoning with Individuals for the Description Logic SHIQ
Abstract. While there has been a great deal of work on the development of reasoning algorithms for expressive description logics, in most cases only Tbox reasoning is considered. I...
Ian Horrocks, Ulrike Sattler, Stephan Tobies
ICDT
1995
ACM
105views Database» more  ICDT 1995»
15 years 7 months ago
Datalog Queries of Set Constraint Databases
Abstract. Extension of the relational database model to represent complex data has been a focus of much research in recent years. At the same time, an alternative extension of the ...
Peter Z. Revesz
SDM
2012
SIAM
208views Data Mining» more  SDM 2012»
13 years 6 months ago
Mining Massive Archives of Mice Sounds with Symbolized Representations
Many animals produce long sequences of vocalizations best described as “songs.” In some animals, such as crickets and frogs, these songs are relatively simple and repetitive c...
Jesin Zakaria, Sarah Rotschafer, Abdullah Mueen, K...