Semantics of Input-Consuming Logic Programs


Share/Save/Bookmark

Bossi, Annalisa and Etalle, Sandro and Rossi, Sabina (2000) Semantics of Input-Consuming Logic Programs. In: First International Conference on Computational Logic, CL 2000, July 24-28, 2000, London, UK.

[img]
Preview
PDF
200Kb
Abstract:Input-consuming programs are logic programs with an additional restriction on the selectability (actually, on the resolvability) of atoms. this class of programs arguably allows to model logic programs employing a dynamic selection rule and constructs such as delay declarations: as shown also in [5], a large number of them are actually input-consuming.
in this paper we show that - under some syntactic restrictions - the tex2html_wrap_inline117-semantics of a program is correct and fully abstract also for input-consuming programs. this allows us to conclude that for a large class of programs employing delay declarations there exists a model-theoretic semantics which is equivalent to the operational one.
Item Type:Conference or Workshop Item
Copyright:© 2000 Springer
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Link to this item:http://purl.utwente.nl/publications/56162
Official URL:http://dx.doi.org/10.1007/3-540-44957-4_13
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page