Информационная система "Конференции"

Abstracts

Applications of logic in computer science

We present a simple yet powerful calculus, the reduction calculus, for propositional logic. The calculus is proved to be sound and complete. The calculus can be used in a helper algorithm for tautology and satisfiability test. We compare the reduction calculus to the well-known resolution calculus. We argue that resolution is in some sense as powerful as our simpler reduction calculus. Keywords: Mathematical logic, complexity theory, tautology, satisfiability, NP-complete problem.

Mail to Webmaster alc9@math.nsc.ru

|Home Page| |English Part|

Go to Home