Sorted multi-adjoint logic programs: Termination results and applications

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 3229, Issue , 2004, Pages 252-265

  Damasio C V ^a   Medina, J ^b   Ojeda Aciego, M ^b  

^a UNIVERSIDADE NOVA DE LISBOA   (Portugal)

^b UNIVERSITY OF MÁLAGA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

LOGIC PROGRAMS; MULTI-ADJOINT ALGEBRAS; TERMINATION THEOREMS; UNIVERSAL ALGEBRA; ADJOINTS; FIX-POINT SEMANTICS; MULTI-ADJOINT LOGIC PROGRAMS; TRUTH VALUES;

ALGEBRA; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; PROBABILITY; SET THEORY; THEOREM PROVING; APPLICATION PROGRAMS; ARTIFICIAL INTELLIGENCE; PROBABILISTIC LOGICS; SEMANTICS;

LOGIC PROGRAMMING;

EID: 22944441639     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30227-8_23     Document Type: Conference Paper

References (13)

1. C. V. Damásio, J. Medina and M. Ojeda-Aciego. Termination results for sorted multiadjoint logic programming. In Information Processing and Management of Uncertainty for Knowledge-Based Systems, IPMU'04. Accepted.
2. C. V. Damásio and L. M. Pereira. Monotonic and residuated logic programs. Lect. Notes in Artificial Intelligence 2143, pp. 748-759, 2001.
3. C. V. Damásio and L. M. Pereira. Hybrid probabilistic logic programs as residuated logic programs. Studia Logica, 72(1):113-138, 2002.
4. C. V. Damásio and L. M. Pereira. Sorted monotonic logic programs and their embeddings. In Information Processing and Management of Uncertainty for Knowledge-Based Systems, IPMU'04. Accepted.
5. M. Dekhtyar, A. Dekhtyar and V. S. Subrahmanian. Hybrid Probabilistic Programs: Algorithms and Complexity. Proc. of Uncertainty in AI'99 conference, 1999
6. A. Dekhtyar and V. S. Subrahmanian. Hybrid Probabilistic Programs, Journal of Logic Programming 43(3):187-250, 2000
7. M. Kifer and V. S. Subrahmanian, Theory of generalized annotated logic programming and its applications. J. of Logic Programming 12(4):335-367, 1992
8. L. Lakhsmanan and F. Sadri, On a theory of probabilistic deductive databases. Theory and Practice of Logic Programming 1(1):5-42, 2001
9. T. Lukasiewicz. Probabilistic logic programming with conditional constraints. ACM Trans. Comput. Log. 2(3):289-339 (2001).
10. J. Medina, M. Ojeda-Aciego, and P. Vojtáš. Multi-adjoint logic programming with continuous semantics. Lect. Notes in Artificial Intelligence 2173, pp. 351-364, 2001.
11. L. Paulík. Best possible answer is computable for fuzzy SLD-resolution. Lecture Notes on Logic 6, pp. 257-266, 1996.
12. M. H. van Emden. Quantitative deduction and its fixpoint theory. Journal of Logic Programming, 4(1):37-53, 1986.
13. P. Vojtáš. Fuzzy logic programming. Fuzzy Sets and Systems, 124(3):361-370, 2001.