Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnnals of Mathematics and Artificial Intelligence, Volume 83
Volume 83, Number 1, May 2018
- Wafa Jguirim, Wady Naanaa, Martin C. Cooper
:
A polynomial relational class of binary CSP. 1-20 - Régis Riveret, Pietro Baroni, Yang Gao, Guido Governatori, Antonino Rotolo, Giovanni Sartor:
A labelling framework for probabilistic argumentation. 21-71 - Jan Triska, Vilém Vychodil:
Minimal bases of temporal attribute implications. 73-97 - Daniel Berend, Amnon Meisels, Or Peri:
Probabilistic optimal solution assessment for DCOPs. 99-119
Volume 83, Number 2, June 2018
- Ofri Keidar, Noa Agmon:
Safe navigation in adversarial environments. 121-164 - Imen Zghidi, Brahim Hnich, Abdelwaheb Rebaï:
Introducing statistical consistency for infinite chance constraints. 165-181 - Imen Zghidi, Brahim Hnich, Abdelwaheb Rebaï:
Correction to: Introducing statistical consistency for infinite chance constraints. 183 - Lorenz Demey, Hans Smessaert:
Geometric and cognitive differences between logical diagrams for the Boolean algebra B4. 185-208
Volume 83, Numbers 3-4, August 2018
- Marc Gyssens, Guillermo Ricardo Simari:
Preface. 209-212 - Luís Cruz-Filipe, Graça Gaspar, Isabel Nunes, Peter Schneider-Kamp:
Active integrity constraints for general-purpose knowledge bases. 213-246 - Christoph Beierle, Christian Eichhorn, Gabriele Kern-Isberner, Steven Kutsch:
Properties of skeptical c-inference for conditional knowledge bases and its realization as a constraint satisfaction problem. 247-275 - Bernhard Bliem, Stefan Woltran:
Equivalence between answer-set programs under (partially) fixed input. 277-295 - Arnaud Durand, Miika Hannula, Juha Kontinen, Arne Meier, Jonni Virtema:
Approximation and dependence via multiteam semantics. 297-320 - Flavio Ferrarotti, Klaus-Dieter Schewe, Loredana Tec, Qing Wang:
A unifying logic for non-deterministic, parallel and concurrent abstract state machines. 321-349 - Ioannis Kokkinis:
The complexity of satisfiability in non-iterated and iterated probabilistic logics. 351-382
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-05-10 18:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
