Sergei G. Vorobyov, Andrei Voronkov. Complexity of Nonrecursive Logic Programs with Complex Values. In Proceedings of the Seventeenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 1-3, 1998, Seattle, Washington. pages 244-253, ACM Press, 1998. [doi]
@inproceedings{VorobyovV98,
title = {Complexity of Nonrecursive Logic Programs with Complex Values},
author = {Sergei G. Vorobyov and Andrei Voronkov},
year = {1998},
doi = {10.1145/275487.275515},
url = {http://doi.acm.org/10.1145/275487.275515},
tags = {logic programming, logic},
researchr = {https://researchr.org/publication/VorobyovV98},
cites = {0},
citedby = {0},
pages = {244-253},
booktitle = {Proceedings of the Seventeenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 1-3, 1998, Seattle, Washington},
publisher = {ACM Press},
isbn = {0-89791-996-3},
}