On the complexity of Boolean unification (Q293360): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(5 intermediate revisions by 5 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q17 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68T15 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6590751 / rank
 
Normal rank
Property / zbMATH Keywords
 
computational complexity
Property / zbMATH Keywords: computational complexity / rank
 
Normal rank
Property / zbMATH Keywords
 
automatic theorem proving
Property / zbMATH Keywords: automatic theorem proving / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57383729 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unification in the union of disjoint equational theories: Combining decision procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unification in Boolean rings and Abelian groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: A resolution principle for a logic with restricted quantifiers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding Boolean expressions into logic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Processor Scheduling with Start-Times and Deadlines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unification algorithms cannot be combined in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3703293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Boolean algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boolean unification - the story so far / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unification in Boolean rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: AC-superposition with constraints: No AC-unifiers needed / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4083731 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unification in a combination of arbitrary disjoint equational theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4131648 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1981232804 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:08, 30 July 2024

scientific article
Language Label Description Also known as
English
On the complexity of Boolean unification
scientific article

    Statements

    Identifiers