Show simple item record

dc.contributor.authorHutschenreiter L
dc.contributor.authorPeñaloza R
dc.contributor.editorDrewes F
dc.contributor.editorMartin-Vide C
dc.contributor.editorTruthe B
dc.date2017-06-16T00:00:00Z
dc.date.accessioned2017-11-14T12:51:35Z
dc.date.available2017-11-14T12:51:35Z
dc.date.issued2017
dc.identifier.isbn978-3-319-53732-0
dc.identifier.issn0302-9743
dc.identifier.urihttp://dx.doi.org/10.1007/978-3-319-53733-7_7
dc.identifier.urihttp://hdl.handle.net/10863/3796
dc.description.abstractConsequence-based and automata-based algorithms encompass two families of approaches that have been thoroughly studied as reasoning methods for many logical formalisms. While automata are useful for finding tight complexity bounds, consequence-based algorithms are typically simpler to describe, implement, and optimize. In this paper, we show that consequence-based reasoning can be reduced to the emptiness test of an appropriately built automaton. Thanks to this reduction, one can focus on developing efficient consequence-based algorithms, obtaining complexity bounds and other benefits of automata methods for free.en_US
dc.language.isoenen_US
dc.publisherSpringeren_US
dc.relation.ispartofseriesLecture Notes in Computer Science;
dc.rights
dc.titleAn Automata View to Goal-Directed Methodsen_US
dc.typeBook chapteren_US
dc.date.updated2017-07-10T13:22:49Z
dc.publication.titleProceedings of the 11th International Conference on Languages and Automata Theory and Applications
dc.language.isiEN-GB
dc.description.fulltextopenen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record