OpenAlex 195 works 12 author topics
Works
195 works
-
Tight logic programs 2003OpenAlex top 1% OpenAlex 99.2%
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…
-
OpenAlex top 10%
OpenAlex 94.7%
No abstract yet.
-
Reconstructing the Evolutionary History of Indo-European Languages Using Answer Set Programming 2002OpenAlex 88.8%
No abstract yet.
-
YÖKSİS
SJR Q3
JCR Q4
OpenAlex 89.4%
No abstract yet.
-
OpenAlex top 10%
OpenAlex 92.1%
No abstract yet.
-
OpenAlex 83.9%
No abstract yet.
-
OpenAlex 75.5%
No abstract yet.
-
OpenAlex 87.0%
No abstract yet.
-
OpenAlex 70.4%
No abstract yet.
-
% & ' ( ) # +* , -. )/ 0 0 1 2 3 $ 54 64 7 % 6 * 8 9* , : 7: 7 5; < % = # $ % ?>
-
OpenAlex 87.9%
No abstract yet.
-
OpenAlex 17.1%
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…
Academicians
12 academicians
- ESRA ERDEM PATOĞLU 18 author topics
- ÇİĞDEM GENCER BALBİANİ 16 author topics
- DEVRİM İNCE 9 author topics
- SÜHA ORHUN MUTLUERGİL 8 author topics
- HAKAN METİN 4 author topics
- HÜSEYİN PEHLİVAN 3 author topics
- ADEM ÖZYAVAŞ 2 author topics
- MEHMET UTKAN GEZER 2 author topics
- RAHİME YILMAZ 2 author topics
- ZAFER ÖZDEMİR 2 author topics
- İHSAN ÖVGE ÖZTÜRK 1 author topics
- SELÇUK YAZAR 1 author topics