DE eng

Search in the Catalogues and Directories

Page: 1 2
Hits 1 – 20 of 32

1
Complexity of stability ...
BASE
Show details
2
Complexity of stability
In: Journal of Computer and System Sciences, 123 (2022)
BASE
Show details
3
Incremental Acquisition of a Minimalist Grammar using an SMT-Solver
In: Proceedings of the Society for Computation in Linguistics (2022)
BASE
Show details
4
ASTERYX : A model-Agnostic SaT-basEd appRoach for sYmbolic and score-based eXplanations
In: CIKM '21: The 30th ACM International Conference on Information and Knowledge Management ; https://hal.archives-ouvertes.fr/hal-03614106 ; CIKM '21: The 30th ACM International Conference on Information and Knowledge Management, Nov 2021, Virtual Event Queensland Australia, Australia. pp.120-129, ⟨10.1145/3459637.3482321⟩ ; https://www.cikm2021.org/ (2021)
BASE
Show details
5
Pspace-Completeness of the Temporal Logic of Sub-Intervals and Suffixes
Bozzelli, Laura; Montanari, Angelo; Peron, Adriano. - : LIPIcs - Leibniz International Proceedings in Informatics. 28th International Symposium on Temporal Representation and Reasoning (TIME 2021), 2021
BASE
Show details
6
Pspace-Completeness of the Temporal Logic of Sub-Intervals and Suffixes ...
Bozzelli, Laura; Montanari, Angelo; Peron, Adriano. - : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021
BASE
Show details
7
Complexity of Stability ...
Frei, Fabian; Hemaspaandra, Edith; Rothe, Jörg. - : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020
BASE
Show details
8
Complexity of Stability ...
BASE
Show details
9
Complexity of Stability
In: Leibniz International Proceedings in Informatics, 181 ; 31st International Symposium on Algorithms and Computation (ISAAC 2020) (2020)
BASE
Show details
10
Inferring Minimalist Grammars with an SMT-Solver
In: Proceedings of the Society for Computation in Linguistics (2020)
BASE
Show details
11
Decidable XPath Fragments in the Real World
In: 38th ACM Symposium on Principles of Database Systems (PODS'19) ; https://hal.inria.fr/hal-01852475 ; 38th ACM Symposium on Principles of Database Systems (PODS'19), 2019, Amsterdam, Netherlands. ⟨10.1145/3294052.3319685⟩ (2019)
BASE
Show details
12
Voting on multi-issue domains with conditionally lexicographic preferences
BASE
Show details
13
Voting-based ensemble learning for partial lexicographic preference forests over combinatorial domains
In: UNF Faculty Publications (2019)
BASE
Show details
14
Automatically improving constraint models in Savile Row
BASE
Show details
15
Specifying and verifying program transformations with PTRANS
Mansky, William. - 2014
BASE
Show details
16
Automatic techniques for proving correctness of heap-manipulating programs
Qiu, Xiaokang. - 2013
BASE
Show details
17
Seeing, knowing, doing: case studies in modal logic ; Voir, savoir, faire : une étude de cas en logique modale
Schwarzentruber, François. - : HAL CCSD, 2010
In: https://tel.archives-ouvertes.fr/tel-00609903 ; Modélisation et simulation. Université Paul Sabatier - Toulouse III, 2010. Français (2010)
BASE
Show details
18
SAT-based Answer Set Programming
In: Computer Science Faculty Publications (2010)
BASE
Show details
19
Manipulation of elections by minimal coalitions
BASE
Show details
20
SAT-based answer set programming
Lierler, Yuliya. - 2010
BASE
Show details

Page: 1 2

Catalogues
0
0
0
0
0
0
0
Bibliographies
0
0
0
0
0
0
0
0
0
Linked Open Data catalogues
0
Online resources
0
0
0
0
Open access documents
32
0
0
0
0
© 2013 - 2024 Lin|gu|is|tik | Imprint | Privacy Policy | Datenschutzeinstellungen ändern