Multi-adjoint Logic Programming with Continuous Semantics.
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F01%3A06010106" target="_blank" >RIV/67985807:_____/01:06010106 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Multi-adjoint Logic Programming with Continuous Semantics.
Original language description
Considering different implication operators, such as Lukasiewicz, Gödel or product implication in the same logic program, naturally leads to the allowance of several adjoint pairs in the lattice of truth-values. In this paper we apply this idea to introduce multi-adjoint logic programs as an extension of monotonic logic programs. The continuity of the immediate consequences operators is proved and the assumptions required to get continuity are further analysed.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GA201%2F00%2F1489" target="_blank" >GA201/00/1489: Soft Computing: Theoretical foundations and experiments</a><br>
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
Logic Programming and Nonmonotonic Reasoning. Proceedings.
ISBN
3-540-42593-4
ISSN
—
e-ISSN
—
Number of pages
14
Pages from-to
351-364
Publisher name
Springer
Place of publication
Berlin
Event location
Vienna [AT]
Event date
Sep 17, 2001
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—