Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"The complexity of satisfiability in non-iterated and iterated ..."

Ioannis Kokkinis (2018)

> Home

Details and statistics

DOI: 10.1007/S10472-018-9593-Y

access: closed

type: Journal Article

metadata version: 2018-08-11

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/amai/Kokkinis18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/amai/Kokkinis18
Ioannis Kokkinis:
The complexity of satisfiability in non-iterated and iterated probabilistic logics. Ann. Math. Artif. Intell. 83(3-4): 351-382 (2018)

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.