Sciweavers

2035 search results - page 272 / 407
» On the complexity of stratified logics
Sort
View
90
Voted
DLOG
2007
15 years 3 months ago
Partitioning ABoxes Based on Converting DL to Plain Datalog
Abstract. To make ABox reasoning scalable for large ABoxes in description logic (DL) knowledge bases, we develop a method for partitioning the ABox so that specific kinds of reaso...
Jianfeng Du, Yi-Dong Shen
DLOG
2008
15 years 3 months ago
Realization Problem for Formal Concept Analysis
Formal Concept Analysis (FCA) is an approach to knowledge engineering, representation, and analysis. A `standard' FCA-workflow starts with some `experimental' data, class...
Nikolay Shilov
92
Voted
WSC
2007
15 years 3 months ago
Enabling industrial scale simulation/emulation models
OLE Process Control (OPC) is an industry standard that facilitates the communication between PCs and Programmable Logic Controllers (PLC). This communication allows for the testin...
Michael Johnstone, Douglas C. Creighton, Saeid Nah...
AI
2006
Springer
15 years 2 months ago
A Smart Home Agent for Plan Recognition
Assistance to people suffering from cognitive deficiencies in a smart home raises complex issues. Plan recognition is one of them. We propose a formal framework for the recognition...
Bruno Bouchard, Sylvain Giroux, Abdenour Bouzouane
115
Voted
PODS
2010
ACM
159views Database» more  PODS 2010»
15 years 2 months ago
On probabilistic fixpoint and Markov chain query languages
We study highly expressive query languages such as datalog, fixpoint, and while-languages on probabilistic databases. We generalize these languages such that computation steps (e....
Daniel Deutch, Christoph Koch, Tova Milo