Logic, programming, and type systems

This note is about the relationship between two theories of negation as failure – one based on program completion, the other based on stable models, or answer sets. François Fages showed that if a logic program satisfies a certain syntactic condition, which is now called ‘tightness,’ then its stable models can be char…

Özet henüz yok.

Özet henüz yok.

Özet henüz yok.

• DOĞAN ULUS

Özet henüz yok.

Özet henüz yok.

Özet henüz yok.

Özet henüz yok.

Özet henüz yok.

% & ' ( ) # +* , -. )/ 0 0 1 2 3 $ 54 64 7 % 6 * 8 9* , : 7: 7 5; < % = # $ % ?>

Özet henüz yok.

We 1 study uniflcation of formulas in modal logics and consider logics which are equivalent w.r.t. uniflcation of formulas. A criterium is given for equivalence w.r.t. uniflcation via existence or persistent formulas. A complete syntactic description of all formulas which are non-uniflable in wide classes of modal log…