A Procedural Semantics for Multi-adjoint logic Programming.
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F01%3A06020209" target="_blank" >RIV/67985807:_____/01:06020209 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
A Procedural Semantics for Multi-adjoint logic Programming.
Original language description
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 semanticsis given for the paradigm of multi-adjoint logic programming and completeness theorems are proved.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2001
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Progress in Artificial Intelligence. Knowledge Extraction, multi-agent Systems, Logic Programming and Constraint Solving.
ISBN
3-540-43030-X
ISSN
—
e-ISSN
—
Number of pages
8
Pages from-to
290-297
Publisher name
Springer
Place of publication
Berlin
Event location
Porto [PT]
Event date
Dec 17, 2001
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—