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

Method of analytic tableaux

Known as: Truth-tree, Tableau, Tableau proof 
In proof theory, the semantic tableau (French pronunciation: ​[ta'blo]; singular: tableau; plural: tableaux), also called truth tree, is a decision… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2006
Highly Cited
2006
We describe an extension of the description logic underlying OWL-DL, SHOIN, with a number of expressive means that we believe… Expand
  • figure 1
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Symbolic Model Checking [3, 14] has proven to be a powerful technique for the verification of reactive systems. BDDs [2] have… Expand
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Of special interest in formal verification are safety properties, which assert that the system always stays within some allowed… Expand
Is this relevant?
Highly Cited
1997
Highly Cited
1997
The paper studies new unit propagation based heuristics for Davis-Putnam-Loveland (DPL) procedure. These are the novel… Expand
  • figure 4
  • figure 5
  • figure 6
  • table 2
  • table 1
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Planning is a notoriously hard combinatorial search problem. In many interesting domains, current planning algorithms fail to… Expand
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Part I. Calculus Of Tableux: 1. Bumping and sliding 2. Words: the plactic monoid 3. Increasing sequences: proofs of the claims 4… Expand
Is this relevant?
Highly Cited
1994
Highly Cited
1994
We describe a framework for compositional verification of finite-state processes. The framework is based on two ideas: a subset… Expand
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1993
Highly Cited
1993
The theory of the natural numbers with linear order and monadic predicates underlies propositional linear temporal logic. To… Expand
Is this relevant?
Highly Cited
1979
Highly Cited
1979
Presented is a computation method—the chase—for testing implication of data dependencies by a set of data dependencies. The chase… Expand
  • figure 2
  • figure 5
Is this relevant?
Highly Cited
1970
Highly Cited
1970
A data processing system includes a memory arrangement comprising a main memory, and a cache memory including a validity bit per… Expand
  • figure 1
  • figure 3
Is this relevant?