From domino tilings to a new model of computation

Bogdan S. Chlebus

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

A new model of computation called VH-system is introduced. It is a formalization of domino tilings. We show how the semantics of nondeterminism on VH-systems, being a natural counterpart of the machinery of tilings, can be modified to cover both deterministic and alternating computations. As a by-product we present a new proof of the fact that the satisfiability problem of boolean Horn formulas is complete in PTIME.

Original languageEnglish (US)
Title of host publicationComputation Theory - 5th Symposium, Proceedings
EditorsAndrzej Skowron
PublisherSpringer Verlag
Pages24-33
Number of pages10
ISBN (Print)9783540160663
DOIs
StatePublished - Jan 1 1985
Externally publishedYes
Event5th Symposium on Computation Theory, SCT 1984 - Zaborow, Poland
Duration: Dec 3 1984Dec 8 1984

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume208 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference5th Symposium on Computation Theory, SCT 1984
CountryPoland
CityZaborow
Period12/3/8412/8/84

Fingerprint

Domino Tilings
Models of Computation
Nondeterminism
Satisfiability Problem
Tiling
Formalization
Machinery
Byproducts
Semantics
Cover

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Chlebus, B. S. (1985). From domino tilings to a new model of computation. In A. Skowron (Ed.), Computation Theory - 5th Symposium, Proceedings (pp. 24-33). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 208 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-16066-3_4

From domino tilings to a new model of computation. / Chlebus, Bogdan S.

Computation Theory - 5th Symposium, Proceedings. ed. / Andrzej Skowron. Springer Verlag, 1985. p. 24-33 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 208 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Chlebus, BS 1985, From domino tilings to a new model of computation. in A Skowron (ed.), Computation Theory - 5th Symposium, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 208 LNCS, Springer Verlag, pp. 24-33, 5th Symposium on Computation Theory, SCT 1984, Zaborow, Poland, 12/3/84. https://doi.org/10.1007/3-540-16066-3_4
Chlebus BS. From domino tilings to a new model of computation. In Skowron A, editor, Computation Theory - 5th Symposium, Proceedings. Springer Verlag. 1985. p. 24-33. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/3-540-16066-3_4
Chlebus, Bogdan S. / From domino tilings to a new model of computation. Computation Theory - 5th Symposium, Proceedings. editor / Andrzej Skowron. Springer Verlag, 1985. pp. 24-33 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{e3752493603442618945330e400061f1,
title = "From domino tilings to a new model of computation",
abstract = "A new model of computation called VH-system is introduced. It is a formalization of domino tilings. We show how the semantics of nondeterminism on VH-systems, being a natural counterpart of the machinery of tilings, can be modified to cover both deterministic and alternating computations. As a by-product we present a new proof of the fact that the satisfiability problem of boolean Horn formulas is complete in PTIME.",
author = "Chlebus, {Bogdan S.}",
year = "1985",
month = "1",
day = "1",
doi = "10.1007/3-540-16066-3_4",
language = "English (US)",
isbn = "9783540160663",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "24--33",
editor = "Andrzej Skowron",
booktitle = "Computation Theory - 5th Symposium, Proceedings",

}

TY - GEN

T1 - From domino tilings to a new model of computation

AU - Chlebus, Bogdan S.

PY - 1985/1/1

Y1 - 1985/1/1

N2 - A new model of computation called VH-system is introduced. It is a formalization of domino tilings. We show how the semantics of nondeterminism on VH-systems, being a natural counterpart of the machinery of tilings, can be modified to cover both deterministic and alternating computations. As a by-product we present a new proof of the fact that the satisfiability problem of boolean Horn formulas is complete in PTIME.

AB - A new model of computation called VH-system is introduced. It is a formalization of domino tilings. We show how the semantics of nondeterminism on VH-systems, being a natural counterpart of the machinery of tilings, can be modified to cover both deterministic and alternating computations. As a by-product we present a new proof of the fact that the satisfiability problem of boolean Horn formulas is complete in PTIME.

UR - http://www.scopus.com/inward/record.url?scp=84926364515&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84926364515&partnerID=8YFLogxK

U2 - 10.1007/3-540-16066-3_4

DO - 10.1007/3-540-16066-3_4

M3 - Conference contribution

AN - SCOPUS:84926364515

SN - 9783540160663

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 24

EP - 33

BT - Computation Theory - 5th Symposium, Proceedings

A2 - Skowron, Andrzej

PB - Springer Verlag

ER -