Pages that link to "Item:Q1824411"

The following pages link to Boolean unification - the story so far (Q1824411):

Displaying 15 items.

• On the complexity of Boolean unification (Q293360) (← links)
• Algorithmic introduction of quantified cuts (Q402115) (← links)
• Unification, finite duality and projectivity in varieties of Heyting algebras (Q598304) (← links)
• The calculus of context relations (Q918720) (← links)
• Unification problem in equational theories (Q1280985) (← links)
• Negative Boolean constraints (Q1350538) (← links)
• Introduction to ``Milestones in interactive theorem proving'' (Q1663212) (← links)
• Unification algorithms cannot be combined in polynomial time. (Q1854364) (← links)
• Running time experiments on some algorithms for solving propositional satisfiability problems (Q1897402) (← links)
• Best solving modal equations (Q1971794) (← links)
• Boolean functional synthesis: hardness and practical algorithms (Q2050108) (← links)
• A new combination procedure for the word problem that generalizes fusion decidability results in modal logics (Q2432763) (← links)
• The unification type of the Pythagorean equation in varieties of nilpotent rings (Q2457315) (← links)
• Towards Parallel Boolean Functional Synthesis (Q3303903) (← links)
• The Evaluation and the Computational Complexity of Datalog Queries of Boolean Constraint Databases (Q3839873) (← links)