Sciweavers

454 search results - page 54 / 91
» Representation results for defeasible logic
Sort
View
DATE
2000
IEEE
169views Hardware» more  DATE 2000»
14 years 1 months ago
Transformational Placement and Synthesis
Novel methodology and algorithms to seamlessly integrate logic synthesis and physical placement through a transformational approach are presented. Contrary to most placement algor...
Wilm E. Donath, Prabhakar Kudva, Leon Stok, Paul V...
KR
2010
Springer
14 years 1 months ago
Status QIO: Conjunctive Query Entailment Is Decidable
Description Logics (DLs) are knowledge representation formalisms that provide, for example, the logical underpinning of the W3C OWL standards. Conjunctive queries (CQs), the stand...
Birte Glimm, Sebastian Rudolph
PKDD
2009
Springer
170views Data Mining» more  PKDD 2009»
14 years 3 months ago
Statistical Relational Learning with Formal Ontologies
Abstract. We propose a learning approach for integrating formal knowledge into statistical inference by exploiting ontologies as a semantically rich and fully formal representation...
Achim Rettinger, Matthias Nickles, Volker Tresp
TACAS
2005
Springer
124views Algorithms» more  TACAS 2005»
14 years 2 months ago
Dynamic Symmetry Reduction
Abstract. Symmetry reduction is a technique to combat the state explosion problem in temporal logic model checking. Its use with symbolic representation has suffered from the proh...
E. Allen Emerson, Thomas Wahl
FMCAD
2006
Springer
14 years 10 days ago
Advanced Unbounded Model Checking Based on AIGs, BDD Sweeping, And Quantifier Scheduling
In this paper we present a complete method for verifying properties expressed in the temporal logic CTL. In contrast to the majority of verification methods presented in recent yea...
Florian Pigorsch, Christoph Scholl, Stefan Disch