Properties of SLUR Formulae (Q2891367)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Properties of SLUR Formulae	scientific article

Statements

scholarly article

0 references

Properties of SLUR Formulae (English)

0 references

0 references

0 references

0 references

SOFSEM 2012: Theory and Practice of Computer Science

0 references

publication date

15 June 2012

0 references

zbMATH Keywords

Boolean functions

0 references

CNF satisfiability

0 references

unit resolution

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-642-27660-6_15

0 references

Recognizing disguised NR(1) instances of the satisfiability problem

0 references

Extended Horn sets in propositional logic

0 references

Balanced matrices

0 references

A hierarchy of tractable satisfiability problems

0 references

Linear-time algorithms for testing the satisfiability of propositional horn formulae

0 references

A perspective on certain polynomial-time solvable classes of satisfiability

0 references

0 references

0 references

Unification as a complexity measure for logic programming

0 references

Renaming a Set of Clauses as a Horn Set

0 references

LTUR: A simplified linear-time unit resolution algorithm for Horn formulae and computer implementation

0 references

On finding solutions for extended Horn formulas

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-642-27660-6_15

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2891367

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2891367&oldid=35284398"