Deciding \(\mathcal H_1\) by resolution (Q1041797): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
(One intermediate revision by one other user not shown) | |||
Property / DOI | |||
Property / DOI: 10.1016/j.ipl.2005.04.007 / rank | |||
Property / cites work | |||
Property / cites work: Q2751353 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Paths vs. trees in set-based program analysis / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Abstraction and resolution modulo AC: How to verify Diffie--Hellman-like protocols automatically / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4539643 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4411948 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Haskell overloading is DEXPTIME-complete / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4263167 / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1016/J.IPL.2005.04.007 / rank | |||
Normal rank |
Latest revision as of 14:36, 10 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Deciding \(\mathcal H_1\) by resolution |
scientific article |
Statements
Deciding \(\mathcal H_1\) by resolution (English)
0 references
4 December 2009
0 references
automatic theorem proving
0 references
formal languages
0 references
0 references