Sciweavers

1462 search results - page 149 / 293
» Autoepistemic Description Logics
Sort
View
ENTCS
2007
109views more  ENTCS 2007»
15 years 6 months ago
Hybrid Logics and Ontology Languages
Description Logics (DLs) are a family of logic based knowledge representation formalisms. Although they have a range of applications, they are perhaps best known as the basis for ...
Ian Horrocks, Birte Glimm, Ulrike Sattler
ML
2008
ACM
150views Machine Learning» more  ML 2008»
15 years 6 months ago
Learning probabilistic logic models from probabilistic examples
Abstract. We revisit an application developed originally using Inductive Logic Programming (ILP) by replacing the underlying Logic Program (LP) description with Stochastic Logic Pr...
Jianzhong Chen, Stephen Muggleton, José Car...
ISMVL
2007
IEEE
104views Hardware» more  ISMVL 2007»
16 years 21 days ago
Evaluation of Toggle Coverage for MVL Circuits Specified in the SystemVerilog HDL
Designing modern circuits comprised of millions of gates is a very challenging task. Therefore new directions are investigated for efficient modeling and verification of such syst...
Mahsan Amoui, Daniel Große, Mitchell A. Thor...
SEBD
2001
145views Database» more  SEBD 2001»
15 years 7 months ago
Reasoning over Conceptual Schemas and Queries in Temporal Databases
This paper introduces a new logical formalism, intended for temporal conceptual modelling, as a natural combination of the well-known description logic DLR and point-based linear ...
Alessandro Artale, Enrico Franconi, Milenko Mosuro...
BIRTHDAY
2010
Springer
15 years 7 months ago
Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...
Martin Grohe