A Procedural Semantics for Multi-adjoint logic Programming

0404839 - UIVT-O 20020209 RIV DE eng C - Konferenční příspěvek (zahraniční konf.)
Medina, J. - Ojeda-Aciego, M. - Vojtáš, Peter
A Procedural Semantics for Multi-adjoint logic Programming.
Progress in Artificial Intelligence. Knowledge Extraction, multi-agent Systems, Logic Programming and Constraint Solving. Berlin: Springer, 2001 - (Brazdil, P.; Jorge, A.), s. 290-297. Lecture Notes in Artificial Intelligence, 2258. ISBN 3-540-43030-X.
[EPIA 2001. Portuguese Conference on Artificial Intelligence /6./. Porto (PT), 17.12.2001-20.12.2001]
Grant ostatní: VEGA(SK) 1/7557/20
Výzkumný záměr: AV0Z1030915
Klíčová slova: many valued logic programming * procedural semantics * completeness theorem
Kód oboru RIV: BA - Obecná matematika

Multi-adjoint logic program generalise monotonic logic programs introduced by Damasio and Pereira in that simultaneous use of several implications in the rules and rather general connectives in the bodies are allowed. In this work, a procedural semantics is given for the paradigm of multi-adjoint logic programming and completeness theorems are proved.
Trvalý link: http://hdl.handle.net/11104/0125069