Sciweavers

158 search results - page 3 / 32
» Space Efficiency of Propositional Knowledge Representation F...
Sort
View
LOGCOM
2007
59views more  LOGCOM 2007»
13 years 6 months ago
Forgetting Literals with Varying Propositional Symbols
Recently, the old logical notion of forgetting propositional symbols (or reducing the logical vocabulary) has been generalized to a new notion: forgetting literals. The aim was to...
Yves Moinard
AAAI
2006
13 years 7 months ago
Learning Partially Observable Action Models: Efficient Algorithms
We present tractable, exact algorithms for learning actions' effects and preconditions in partially observable domains. Our algorithms maintain a propositional logical repres...
Dafna Shahaf, Allen Chang, Eyal Amir
ER
2003
Springer
150views Database» more  ER 2003»
13 years 11 months ago
EITH - A Unifying Representation for Database Schema and Application Code in Enterprise Knowledge Extraction
The integration of heterogeneous legacy databases requires understanding of database structure and content. We previously developed a theoretical and software infrastructure to sup...
Mark S. Schmalz, Joachim Hammer, Mingxi Wu, Oguzha...
C3S2E
2010
ACM
13 years 7 months ago
Scalable formula decomposition for propositional satisfiability
Propositional satisfiability solving, or SAT, is an important reasoning task arising in numerous applications, such as circuit design, formal verification, planning, scheduling or...
Anthony Monnet, Roger Villemaire
ICFCA
2010
Springer
13 years 11 months ago
A Survey of Hybrid Representations of Concept Lattices in Conceptual Knowledge Processing
A feature of Formal Concept Analysis is the use of the line diagram of the concept lattice to visualize a conceptual space. The line diagram is a specialized form of Hasse diagram ...
Peter W. Eklund, Jean Villerd