Sciweavers

1545 search results - page 163 / 309
» Defeasible Description Logics
Sort
View
ML
2008
ACM
150views Machine Learning» more  ML 2008»
13 years 8 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»
14 years 2 months 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»
13 years 9 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...
EUSFLAT
2009
212views Fuzzy Logic» more  EUSFLAT 2009»
13 years 5 months ago
An Interval Type-2 Fuzzy Distribution Network
Abstract-- Planning resources for a supply chain is a major factor determining its success or failure. In this paper we introduce an Interval Type-2 Fuzzy Logic model of a distribu...
Simon Miller, Viara Popova, Robert John, Mario A. ...
BIRTHDAY
2010
Springer
13 years 9 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