Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Johannes Ebbing"'
Publikováno v:
Logical Methods in Computer Science, Vol Volume 10, Issue 3 (2014)
In this paper we study the expressive power of Horn-formulae in dependence logic and show that they can express NP-complete problems. Therefore we define an even smaller fragment D-Horn* and show that over finite successor structures it captures the
Externí odkaz:
https://doaj.org/article/72ca468483ab4f468485baebe0749bdb
Publikováno v:
Journal of Computer and System Sciences. 88:103-125
We introduce a new variant of dependence logic ( D ) called Boolean dependence logic ( BD ). In BD dependence atoms are of the type = ( x 1 , … , x n , α ) , where α is a Boolean variable. Intuitively, with Boolean dependence atoms one can expres
Publikováno v:
Logical Methods in Computer Science 10 (2014), Nr. 3
In this paper we study the expressive power of Horn-formulae in dependence logic and show that they can express NP-complete problems. Therefore we define an even smaller fragment D-Horn* and show that over finite successor structures it captures the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dfa5ef8da2ccb9f30f0dc56087fe7459
http://www.repo.uni-hannover.de/handle/123456789/2005
http://www.repo.uni-hannover.de/handle/123456789/2005
Publikováno v:
Logic, Language, and Computation ISBN: 9783642369759
TbiLLC
TbiLLC
Modal intuitionistic dependence logic ($\mathcal MIDL $) incorporates the notion of "dependence" between propositions into the usual modal logic and has connectives which correspond to intuitionistic connectives in a certain sense. It is the modal ve
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9888289fb1b70b80f55ff8817067c87d
https://doi.org/10.1007/978-3-642-36976-6_15
https://doi.org/10.1007/978-3-642-36976-6_15
Publikováno v:
Logic, Language, Information, and Computation ISBN: 9783642399916
WoLLIC
WoLLIC
We introduce a new variant of dependence logic $\mathcal{D}$ called Boolean dependence logic $\mathcal{BD}$ . In $\mathcal{BD}$ dependence atoms are of the type =x 1,...,x n ,α, where α is a Boolean variable. Intuitively, with Boolean dependence at
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::535852600afa9f4784903a4039a31d72
https://doi.org/10.1007/978-3-642-39992-3_12
https://doi.org/10.1007/978-3-642-39992-3_12
Autor:
Johannes Ebbing, Jonni Virtema, Lauri Hella, Heribert Vollmer, Julian-Steffen Müller, Arne Meier
Publikováno v:
Logic, Language, Information, and Computation ISBN: 9783642399916
In this paper we extend modal dependence logic $\mathcal{MDL}$ by allowing dependence atoms of the form depi¾ź 1,',i¾ź n where i¾ź i , 1≤i≤n, are modal formulas in $\mathcal{MDL}$ , only propositional variables are allowed in dependence ato
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7823577616f7325f429d50350b931989
https://doi.org/10.1007/978-3-642-39992-3_13
https://doi.org/10.1007/978-3-642-39992-3_13
Autor:
Peter Lohmann, Johannes Ebbing
Publikováno v:
SOFSEM 2012: Theory and Practice of Computer Science ISBN: 9783642276590
SOFSEM
SOFSEM
Modal dependence logic (MDL) was introduced recently by Vaananen. It enhances the basic modal language by an operator = (·). For propositional variables p 1 ,…,p n the atomic formula = (p 1 ,…,p n −1 ,p n ) intuitively states that the value of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f82186d1837502e56c12c53a62462505
https://doi.org/10.1007/978-3-642-27660-6_19
https://doi.org/10.1007/978-3-642-27660-6_19
Publikováno v:
Leibniz International Proceedings in Informatics, LIPIcs 13 (2011)
We study the extension of dependence logic $$\mathcal {D}$$D by a majority quantifier $$\mathsf{M}$$M over finite structures. We show that the resulting logic is equi-expressive with the extension of second-order logic by second-order majority quanti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ae827f74ca432b649d3b818f6a3881fc