Pages that link to "Item:Q5958754"
From MaRDI portal
The following pages link to Reductions for non-clausal theorem proving (Q5958754):
Displaying 9 items.
- Generalizations of lattices via non-deterministic operators (Q556843) (← links)
- Proof optimization for partial redundancy elimination (Q843219) (← links)
- Filter-based resolution principle for lattice-valued propositional logic LP\((X)\) (Q867665) (← links)
- General form of \(\alpha\)-resolution principle for linguistic truth-valued lattice-valued logic (Q2392565) (← links)
- (Q4518870) (← links)
- (Q5389723) (← links)
- Logics in Artificial Intelligence (Q5394165) (← links)
- A first polynomial non-clausal class in many-valued logic (Q6083144) (← links)
- Non-finite axiomatisability results via reductions: CSP parallel composition and CCS restriction (Q6163879) (← links)