SAT as a Programming Environment for Linear Algebra

Authors:
Marian Srebrny;Lidia Stepień
Affiliations:
(Correspd.) Institute of Computer Science, Polish Academy of Sciences, Warsaw, Poland and Section of Applied Informatics, University of Commerce, Kielce, Poland. marians@ipipan.waw.pl;Institute of Mathematics and Computer Science, Jan Długosz University, Czestochowa, Poland. l.stepien@ajd.czest.pl
Venue:
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Year:
2010

Citing 4
Cited 1

A Computing Procedure for Quantification Theory

Journal of the ACM (JACM)
A machine program for theorem-proving

Communications of the ACM
An Investigation of the Laws of Thought

An Investigation of the Laws of Thought
A Propositional Programming Environment for Linear Algebra

Fundamenta Informaticae - Topics in Logic, Philosophy and Foundations of Mathematics and Computer Science. In Recognition of Professor Andrzej Grzegorczyk

Bounded model checking for parametric timed automata

Transactions on Petri Nets and Other Models of Concurrency V

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we pursue the propositional calculus and the SATisfiability solvers as a powerful declarative programming environment that makes it possible to create and run the propositional declarative programs for computational tasks in various areas of mathematics. We report some experimental results on our application of the propositional SATisfiability environment to computing some simple orthogonal matrices and the orders of some orthogonal groups. Some encouraging (and not very encouraging) experiments are reported for the proposed propositional search procedures using off-the-shelf general-purpose SAT solvers. Our new software toolkit SAT4Alg is announced.