Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Vivification

Vivification is an operation on a description logic knowledge base to improve performance of a semantic reasoner. Vivification replaces a disjunction… Expand
Wikipedia

Related topics

Related topics

3 relations
Description logicKnowledge baseSemantic reasoner

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
Clause Vivification by Unit Propagation in CDCL SAT Solvers
Original and learnt clauses in Conflict-Driven Clause Learning (CDCL) SAT solvers often contain redundant literals. This may have… Expand
  • figure 1
  • table 1
  • figure 2
  • table 2
  • figure 3
2018
2018
1-1981 Waste Land ( Mewat ) in Judea and Samaria
 
2017
2017
HQSpre - An Effective Preprocessor for QBF and DQBF
We present our new preprocessor HQSpre, a state-of-the-art tool for simplifying quantified Boolean formulas (QBFs) and the first… Expand
  • table 1
  • table 2
  • table 3
  • table 4
  • table 6
2017
2017
MANY-SIDED LIVES: LIBERAL JUDGMENT AND THE REALIST NOVEL
 
2013
2013
Desarrollo tecnológico para elaborar vino blanco común en Misiones, con evaluación económica a escala industrial
El objetivo de este trabajo fue desarrollar una tecnologia sustentable a escala industrial para elaborar vino blanco comun, con… Expand
2012
2012
The Vivification Problem in Real-Time Business Intelligence: A Vision
In the new era of Business Intelligence (BI) technology, transforming massive amounts of data into high-quality business… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
2010
2010
Microtheories for Spatial Data Infrastructures - Accounting for Diversity of Local Conceptualizations at a Global Level
The categorization of our environment into feature types is an essential prerequisite for cartography, geographic information… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Highly Cited
2008
Highly Cited
2008
Vivifying Propositional Clausal Formulae
In this paper, we present a new way to preprocess Boolean formulae in Conjunctive Normal Form (CNF). In contrast to most of the… Expand
  • table 1
2008
2008
Vivification de formules propositionnelles clausales
Dans cet article, nous presentons une nouvelle technique de pretraitement d'une formule booleenne mise sous forme normale… Expand
2004
2004
Anytime clausal reasoning
  • M. Dalal
  • Annals of Mathematics and Artificial Intelligence
  • 2004
    • Corpus ID: 32752480
Given any incomplete clausal propositional reasoner satisfying certain properties, we extend it to a family of increasingly… Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE