|Abstract||Bilattices, introduced by M. Ginsberg, constitute an elegant family of multiple-valued logics. Those meeting certain natural conditions have provided the basis for the semantics of a family of logic programming languages. Now we consider further restrictions on bilattices, to narrow things down to logic programming languages that can, at least in principle, be implemented. Appropriate bilattice background information is presented, so the paper is relatively self-contained.|
|Keywords||No keywords specified (fix it)|
|Categories||No categories specified (fix it)|
|Through your library||Only published papers are available at libraries|
Similar books and articles
Andreas Schöter (1996). Evidential Bilattice Logic and Lexical Inference. Journal of Logic, Language and Information 5 (1).
Melvin Fitting (2006). Bilattices Are Nice Things. In T. Bolander, V. Hendricks & S. A. Pedersen (eds.), Self-Reference. Csli Publications.
Ofer Arieli & Arnon Avron (1996). Reasoning with Logical Bilattices. Journal of Logic, Language and Information 5 (1):25--63.
Carlos Viegas Damásio & Luís Moniz Pereira (2002). Hybrid Probabilistic Logic Programs as Residuated Logic Programs. Studia Logica 72 (1):113 - 138.
Melvin Fitting (1989). Bilattices and the Theory of Truth. Journal of Philosophical Logic 18 (3):225 - 256.
Yining Wu, Martin Caminada & Dov M. Gabbay (forthcoming). Complete Extensions in Argumentation Coincide with 3-Valued Stable Models in Logic Programming. Studia Logica.
Sorry, there are not enough data points to plot this chart.
Added to index2010-12-22
Total downloads1 ( #274,507 of 548,969 )
Recent downloads (6 months)0
How can I increase my downloads?