The following pages link to (Q3996619):
Displaying 50 items.
- A logic of separating modalities (Q290917) (← links)
- First-order dialogical games and tableaux (Q484155) (← links)
- Prime forms and minimal change in propositional belief bases (Q622590) (← links)
- Representing and building models for decidable subclasses of equational clausal logic (Q861367) (← links)
- Some techniques for proving termination of the hyperresolution calculus (Q861692) (← links)
- Dual erotetic calculi and the minimal \(\mathsf{LFI}\) (Q897482) (← links)
- Tableaux and dual tableaux: transformation of proofs (Q995673) (← links)
- How true it is = who says it's true (Q1015490) (← links)
- Constructing infinite models represented by tree automata (Q1044230) (← links)
- A general criterion for avoiding infinite unfolding during partial deduction (Q1205178) (← links)
- Superposition theorem proving for abelian groups represented as integer modules (Q1275020) (← links)
- A proof procedure for the logic of hereditary Harrop formulas (Q1311397) (← links)
- Gentzen-type systems, resolution and tableaux (Q1311413) (← links)
- Adding a temporal dimension to a logic system (Q1314287) (← links)
- On the relative merits of path dissolution and the method of analytic tableaux (Q1331929) (← links)
- Accelerating tableaux proofs using compact representations (Q1334905) (← links)
- A tableau prover for domain minimization (Q1344878) (← links)
- The saturated tableaux for linear miniscope Horn-like temporal logic (Q1344880) (← links)
- The liberalized \(\delta\)-rule in free variable semantic tableaux (Q1344882) (← links)
- Tableau-based characterization and theorem proving for default logic (Q1344885) (← links)
- The complexity of concept languages (Q1363785) (← links)
- On Skolemization in constrained logics (Q1380406) (← links)
- Intuitive minimal abduction in sequent calculi (Q1389097) (← links)
- Extracting models from clause sets saturated under semantic refinements of the resolution rule. (Q1401929) (← links)
- Model building with ordered resolution: Extracting models from saturated clause sets (Q1404975) (← links)
- Simplification of boolean verification conditions (Q1575276) (← links)
- Correspondences between classical, intuitionistic and uniform provability (Q1575924) (← links)
- Structuring and automating hardware proofs in a higher-order theorem- proving environment (Q1801500) (← links)
- Using tableaux to automate the Lambek and other categorial calculi (Q1854380) (← links)
- Cancellative Abelian monoids and related structures in refutational theorem proving. I (Q1864898) (← links)
- Locally Boolean spectra (Q1891270) (← links)
- Tableaus for many-valued modal logic (Q1896755) (← links)
- lean\(T^ AP\): Lean tableau-based deduction (Q1904400) (← links)
- The co-invariant generator: An aid in deriving loop bodies (Q1911318) (← links)
- Herbrand's fundamental theorem in the eyes of Jean van Heijenoort (Q1942097) (← links)
- Human-centered automated proof search (Q2069871) (← links)
- \textsf{Goéland}: a concurrent tableau-based theorem prover (system description) (Q2104525) (← links)
- The model evolution calculus as a first-order DPLL method (Q2389629) (← links)
- Rasiowa-Sikorski deduction systems with the rule of cut: a case study (Q2422312) (← links)
- A semantics for reasoning consistently in the presence of inconsistency (Q2676565) (← links)
- Self-verifying axiom systems, the incompleteness theorem and related reflection principles (Q2747704) (← links)
- Fault-Tolerant Aggregate Signatures (Q2798782) (← links)
- Specifying and Verifying Organizational Security Properties in First-Order Logic (Q3058451) (← links)
- Specification and Verification of Multi-Agent Systems (Q3166991) (← links)
- On Height and Happiness (Q3299847) (← links)
- Congruence Closure with Free Variables (Q3303931) (← links)
- A Tableaux System for Deontic Action Logic (Q3522041) (← links)
- Reasoning about System-Degradation and Fault-Recovery with Deontic Logic (Q3623815) (← links)
- Contraction-free sequent calculi for intuitionistic logic (Q4032862) (← links)
- Annual meeting of the Association for Symbolic Logic, Notre Dame, 1993 (Q4302362) (← links)
