On the Correctness and Efficiency of Lock-Free Expandable Tries for Tabled Logic Programs

AuthID
 P-008-KJS
2
Author(s)
2
Editor(s)
Matthew Flatt; Hai-Feng Guo
Document Type
Proceedings Paper
Year published
2014
Published
in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) in Lecture Notes in Computer Science, ISSN: 0302-9743
Volume: 8324 LNCS, Pages: 168-183
Conference
15Th International Conference on Verification, Model Checking, and Abstract Interpretation, Vmcai 2014, Date: 20 January 2014 through 21 January 2014, Location: San Diego, CA, Sponsors: Association of Logic Programming;ACM
Indexing
Scopus®
Dblp®/en/publications/view/282201
Crossref®6
Google Scholar®
Publication Identifiers
DBLP: conf/padl/AreiasR14
SCOPUS: 2-s2.0-84893437420
Source Identifiers
ISSN: 0302-9743
Export Publication Metadata
Marked List
 Add to Marked List
Info
At this moment we don't have any links to full text documens.

A place for researchers and their institutions

Useful Links

Get Help

© 2024 CRACS & Inesc TEC - All Rights Reserved Privacy Policy | Terms of Service