Hochschulschrift
Valued Constraint Satisfaction Problems over Infinite Domains
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
Dresden, Technische Universität Dresden, Dissertation, 2020
- Schlagwort
-
Satisfaction
Infinite
- Ereignis
-
Veröffentlichung
- (wo)
-
Dresden
- (wer)
-
Technische Universität Dresden
- (wann)
-
2020
- Urheber
- Beteiligte Personen und Organisationen
-
Bodirsky, Manuel
Krokhin, Andrei
- URN
-
urn:nbn:de:bsz:14-qucosa2-715078
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:56 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Objekttyp
- Hochschulschrift
Beteiligte
- Viola, Caterina
- Bodirsky, Manuel
- Krokhin, Andrei
- Technische Universität Dresden
Entstanden
- 2020
Ähnliche Objekte (12)
Valued constraint satisfaction problems over infinite domains
Constraint satisfaction with infinite domains
Constraint satisfaction with infinite domains
The complexity of valued constraint satisfaction problems
Markov logic in infinite domains
Computational complexity of infinite-valued Lukasiewicz propositional logic
Constraint satisfaction with succinctly specified relations
CONSAT, a system for constraint satisfaction
Exact algorithms for constraint satisfaction problems
New algebraic tools for constraint satisfaction
Nonaxiomatizability and undecidability of an infinite-valued temporal logic
Vector-valued elliptic boundary value problems on rough domains
Valued constraint satisfaction problems over infinite domains
Constraint satisfaction with infinite domains
Constraint satisfaction with infinite domains
The complexity of valued constraint satisfaction problems
Markov logic in infinite domains
Computational complexity of infinite-valued Lukasiewicz propositional logic
Constraint satisfaction with succinctly specified relations
CONSAT, a system for constraint satisfaction
Exact algorithms for constraint satisfaction problems
New algebraic tools for constraint satisfaction
Nonaxiomatizability and undecidability of an infinite-valued temporal logic
Vector-valued elliptic boundary value problems on rough domains
Valued constraint satisfaction problems over infinite domains
Constraint satisfaction with infinite domains
Constraint satisfaction with infinite domains
The complexity of valued constraint satisfaction problems
Markov logic in infinite domains
Computational complexity of infinite-valued Lukasiewicz propositional logic
Constraint satisfaction with succinctly specified relations
CONSAT, a system for constraint satisfaction
Exact algorithms for constraint satisfaction problems
New algebraic tools for constraint satisfaction
Nonaxiomatizability and undecidability of an infinite-valued temporal logic