Pages that link to "Item:Q1961448"

The following pages link to An algorithm for the class of pure implicational formulas (Q1961448):

Displaying 8 items.

• On generalizations of the shadow independent set problem (Q878644) (← links)
• The extended alpha-triple I algorithm based on the generalized implication operator (Q1028695) (← links)
• A note on the computational complexity of the pure classical implication calculus (Q1263982) (← links)
• Proof finding algorithms for implicational logics (Q1575928) (← links)
• Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable (Q1765303) (← links)
• Improving a fixed parameter tractability time bound for the shadow problem (Q1877708) (← links)
• Algorithmic correspondence for relevance logics, bunched implication logics, and relation algebras via an implementation of the algorithm \textsf{PEARL} (Q2695349) (← links)
• Computing All Implied Equalities via SMT-Based Partition Refinement (Q3192188) (← links)