Suchergebnisse - Theory of computation → Constraint and logic programming
-
1
Autoren:
Weitere Verfasser:
Quelle: Proceedings of the ACM on Management of Data. 3:1-20
Schlagwörter: Bounded Derivation Depth Property, CCS Concepts: Theory of computation → Constraint and logic programming Finite Model Theory Automated reasoning Logic and databases Chase, Logic and databases Chase, Automated reasoning, CCS Concepts, Finite unification sets, TGDs, FC/BDD Conjecture, Theory of computation → Constraint and logic programming, [INFO.INFO-DB] Computer Science [cs]/Databases [cs.DB], Existential Rules, Tuple Generating Dependencies, BDD, FO-Rewritability, Finite Model Theory, FUS, Finite Controllability
Dateibeschreibung: application/pdf
-
2
Autoren: et al.
Weitere Verfasser: et al.
Schlagwörter: safety, [INFO.INFO-AI] Computer Science [cs]/Artificial Intelligence [cs.AI], logic, computational complexity, [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], databases, Computing methodologies → Logical and relational learning, [INFO.INFO-LG] Computer Science [cs]/Machine Learning [cs.LG], [INFO] Computer Science [cs], General and reference → Surveys and overviews, Computing methodologies → Machine learning approaches, machine learning, Computing methodologies → Artificial intelligence, learning theory, Theory of computation → Models of learning, Theory of computation → Constraint and logic programming, Theory of computation → Modal and temporal logics, verification
Dateibeschreibung: application/pdf
-
3
Autoren: et al.
Weitere Verfasser: et al.
Schlagwörter: Scheduling, Preemptive Resources, Theory of computation → Constraint and logic programming, Computing methodologies → Planning and scheduling, [INFO] Computer Science [cs], ddc:004, Constraint Programming
Dateibeschreibung: application/pdf
-
4
Autoren: et al.
Weitere Verfasser: et al.
Quelle: Constraints. 28:427-449
Schlagwörter: [INFO.INFO-AI] Computer Science [cs]/Artificial Intelligence [cs.AI], Theory of computation → Problems, reductions and completeness, constraint propagation, Minimum explanations, Complexity, Constraint propagation, minimum explanations, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI], Theory of computation → Fixed parameter tractability, Theory of computation → Constraint and logic programming, Fixed parameter tractability, Constraint programming, Constraint and logic programming, ddc:004, complexity
Dateibeschreibung: application/pdf
-
5
Autoren: et al.
Schlagwörter: Datalog, compiler optimization, Theory of computation → Constraint and logic programming, ddc:004, DATA processing & computer science, info:eu-repo/classification/ddc/004
Dateibeschreibung: application/pdf
Relation: info:eu-repo/semantics/altIdentifier/isbn/978-8-33-132289-3; https://publikationen.bibliothek.kit.edu/1000187537; https://publikationen.bibliothek.kit.edu/1000187537/170103974; https://doi.org/10.5445/IR/1000187537/v2
-
6
Autoren: et al.
Weitere Verfasser: et al.
Quelle: 29th International Conference on Principles and Practice of Constraint Programming (CP 2023)
https://hal.science/hal-04241596
29th International Conference on Principles and Practice of Constraint Programming (CP 2023), Aug 2023, Toronto, Canada. pp.24:1--24:15, ⟨10.4230/LIPIcs.CP.2023.24⟩Schlagwörter: 2012 ACM Subject Classification Applied computing → Multi-criterion optimization and decisionmaking, 2012 ACM Subject Classification Applied computing → Multi-criterion optimization and decisionmaking Theory of computation → Constraint and logic programming Mathematics of computing → Decision diagrams phrases Constraint Programming, Global Constraint, MDD, Multi-Objective Problem, Pareto Constraint, Theory of computation → Constraint and logic programming, Mathematics of computing → Decision diagrams phrases Constraint Programming, Constraint Programming, Mathematics of computing → Decision diagrams, Applied computing → Multi-criterion optimization and decision-making, [INFO]Computer Science [cs]
Geographisches Schlagwort: Toronto
Time: Toronto, Canada
-
7
Autoren: et al.
Weitere Verfasser: et al.
Quelle: ACM Transactions on Computation Theory. 14:1-19
Schlagwörter: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), Theory of computation → Design and analysis of algorithms, Theory of computation → Problems, reductions and completeness, 0102 computer and information sciences, Computational Complexity (cs.CC), promise constraint satisfaction, algebraic approach, 01 natural sciences, PCSP, minions, Computer Science - Computational Complexity, Computer Science - Data Structures and Algorithms, Theory of computation → Constraint and logic programming, FOS: Mathematics, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), ddc:004, hypegraph colourings, polymorphisms, Computer Science - Discrete Mathematics
Dateibeschreibung: application/pdf
Zugangs-URL: http://arxiv.org/abs/2204.05628
https://ora.ox.ac.uk/objects/uuid:aeb2c090-f064-478a-81c3-bb2ac8df1192
https://doi.org/10.1145/3570909
https://ora.ox.ac.uk/objects/uuid:86b24d89-ef66-45f8-8a80-8f7507eb601d
https://doi.org/10.4230/lipics.icalp.2022.128
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2022.128 -
8
Autoren: et al.
Weitere Verfasser: et al.
Quelle: ACM Transactions on Computation Theory
47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)Schlagwörter: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), G.2.1, F.2.2, Theory of computation → Problems, reductions and completeness, 0102 computer and information sciences, Computational Complexity (cs.CC), promise constraint satisfaction, algebraic approach, 16. Peace & justice, 01 natural sciences, PCSP, label cover, Computer Science - Computational Complexity, Theory of computation → Constraint and logic programming, 68R05, 68Q17, ddc:004, polymorphisms, Computer Science - Discrete Mathematics
Dateibeschreibung: application/pdf
Zugangs-URL: http://arxiv.org/pdf/1911.09065
http://arxiv.org/abs/1911.09065
https://drops.dagstuhl.de/opus/volltexte/2020/12424/pdf/LIPIcs-ICALP-2020-17.pdf/
https://dblp.uni-trier.de/db/conf/icalp/icalp2020.html#BrandtsWZ20
https://doi.org/10.4230/LIPIcs.ICALP.2020.17
https://drops.dagstuhl.de/opus/volltexte/2020/12424/
https://arxiv.org/abs/1911.09065
https://dblp.uni-trier.de/db/journals/corr/corr1911.html#abs-1911-09065
https://doi.org/10.1145/3470867
http://arxiv.org/pdf/1911.09065.pdf
http://ui.adsabs.harvard.edu/abs/2019arXiv191109065B/abstract
https://dl.acm.org/doi/10.1145/3470867
https://arxiv.org/pdf/1911.09065v3
https://arxiv.org/abs/1911.09065
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.17 -
9
Autoren: et al.
Weitere Verfasser: et al.
Quelle: 29th International Conference on Principles and Practice of Constraint Programming (CP 2023)
https://laas.hal.science/hal-04217223
29th International Conference on Principles and Practice of Constraint Programming (CP 2023), Aug 2023, Toronto, Canada. ⟨10.4230/LIPIcs.CP.2023.31⟩Schlagwörter: 2012 ACM Subject Classification Computing methodologies → Planning and scheduling Applied computing → Industry and manufacturing Theory of computation → Optimization with randomized search heuristics Theory of computation → Constraint and logic programming phrases Large-scale scheduling problem, partial preemption, multi-skill, multi-mode, resource calendars, constraint programming, large neighborhood search, Applied computing → Industry and manufacturing, Theory of computation → Optimization with randomized search heuristics, Theory of computation → Constraint and logic programming phrases Large-scale scheduling problem, Large-scale scheduling problem, Computing methodologies → Planning and scheduling, Theory of computation → Constraint and logic programming, [INFO.INFO-RO]Computer Science [cs]/Operations Research [math.OC]
Geographisches Schlagwort: Toronto
Time: Toronto, Canada
-
10
Autoren: et al.
Weitere Verfasser: et al.
Quelle: 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)
ACM Transactions on AlgorithmsSchlagwörter: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Discrete Mathematics (cs.DM), Valued constraint satisfaction, Theory of computation → Problems, reductions and completeness, valued constraint satisfaction, 0102 computer and information sciences, Computational Complexity (cs.CC), promise constraint satisfaction, 16. Peace & justice, 01 natural sciences, Logic in Computer Science (cs.LO), Computer Science - Computational Complexity, Promise constraint satisfaction, Convex relaxations, Computer Science - Data Structures and Algorithms, Theory of computation → Constraint and logic programming, Data Structures and Algorithms (cs.DS), ddc:004, convex relaxations, 0101 mathematics, Polymorphisms, polymorphisms, Computer Science - Discrete Mathematics
Dateibeschreibung: application/pdf
Zugangs-URL: https://drops.dagstuhl.de/opus/volltexte/2020/12756/pdf/LIPIcs-MFCS-2020-85.pdf
http://arxiv.org/abs/2007.01779
http://ui.adsabs.harvard.edu/abs/2020arXiv200701779V/abstract
https://arxiv.org/pdf/2007.01779.pdf
https://arxiv.org/abs/2007.01779
https://dl.acm.org/doi/10.1145/3458041
https://dblp.uni-trier.de/db/journals/corr/corr2007.html#abs-2007-01779
https://ora.ox.ac.uk/objects/uuid:6bab5669-9398-485d-877c-5bcff547c546
https://doi.org/10.1145/3458041
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.85
https://hdl.handle.net/20.500.11769/605674
https://doi.org/10.4230/LIPIcs.MFCS.2020.85 -
11
Autoren:
Quelle: Theory & Practice of Logic Programming; Sep2024, Vol. 24 Issue 5, p1011-1030, 20p
-
12
Autoren: et al.
Weitere Verfasser: et al.
Quelle: International Conference on Principles and Practice of Constraint Programming (CP) ; https://hal.inrae.fr/hal-04556854 ; International Conference on Principles and Practice of Constraint Programming (CP), Aug 2023, Toronto, Canada. ⟨10.4230/LIPIcs.CP.2023.4⟩ ; https://cp2023.a4cp.org
Schlagwörter: Computing methodologies → Machine learning, Computing methodologies → Learning graphical models, deep learning, constraint programming, cost function networks, random Markov fields, decision-focused learning, protein design .CP.2023, 2012 ACM Subject Classification Computing methodologies → Artificial intelligence, 2012 ACM Subject Classification Computing methodologies → Artificial intelligence Computing methodologies → Machine learning Theory of computation → Constraint and logic programming Computing methodologies → Learning graphical models, Computing methodologies → Learning in probabilistic graphical models, Theory of computation → Constraint and logic programming, Computing methodologies → Artificial intelligence, protein design, graphical models, [INFO.INFO-BI]Computer Science [cs]/Bioinformatics [q-bio.QM], [INFO]Computer Science [cs], [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI], [INFO.INFO-BT]Computer Science [cs]/Biotechnology
Geographisches Schlagwort: Toronto
Time: Toronto, Canada
-
13
Autoren:
Weitere Verfasser:
Schlagwörter: redundancy, Constraint satisfaction problem, Theory of computation → Constraint and logic programming, Mathematics of computing → Discrete mathematics, universal algebra, extremal combinatorics, ddc:004
Dateibeschreibung: application/pdf
-
14
Autoren: et al.
Weitere Verfasser: et al.
Quelle: Leibniz International Proceedings in Informatics (LIPIcs) ; 31st International Conference on Principles and Practice of Constraint Programming (CP 2025) ; https://hal.science/hal-05203873 ; 31st International Conference on Principles and Practice of Constraint Programming (CP 2025), Aug 2025, Glasgow, United Kingdom. pp.19:1--19:21, ⟨10.4230/LIPIcs.CP.2025.19⟩
Schlagwörter: Theory of computation → Logic and verification, Theory of computation → Constraint and logic programming, Theory of computation → Distributed algorithms, Satisfiability, Synchronous Unison, Self-stabilization, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI]
Geographisches Schlagwort: Glasgow, United Kingdom
-
15
Autoren: et al.
Weitere Verfasser: et al.
Quelle: 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)
Schlagwörter: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Constraint satisfaction problem, bounded width, Theory of computation → Problems, reductions and completeness, loop lemma, Mathematics - Logic, 0102 computer and information sciences, 01 natural sciences, Logic in Computer Science (cs.LO), near unanimity operation, local consistency, Theory of computation → Constraint and logic programming, FOS: Mathematics, Theory of computation → Complexity theory and logic, ddc:004, 0101 mathematics, constraint satisfaction problem, earunanimity operation, Logic (math.LO)
Dateibeschreibung: application/pdf
Zugangs-URL: http://arxiv.org/abs/2005.00266
https://drops.dagstuhl.de/opus/volltexte/2020/12517/
https://drops.dagstuhl.de/opus/volltexte/2020/12517/pdf/LIPIcs-ICALP-2020-110.pdf/
https://dblp.uni-trier.de/db/journals/corr/corr2005.html#abs-2005-00266
https://doi.org/10.4230/LIPIcs.ICALP.2020.110
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.110
https://ruj.uj.edu.pl/xmlui/handle/item/252949 -
16
Autoren: et al.
Weitere Verfasser: et al.
Quelle: 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)
Schlagwörter: FOS: Computer and information sciences, Boolean PCSP, Constraint satisfaction problems, Theory of computation → Problems, reductions and completeness, homomorphic relaxation, Mathematics - Logic, 0102 computer and information sciences, Computational Complexity (cs.CC), promise constraint satisfaction, finite tractability, 01 natural sciences, 68Q17, polymorphism, Computer Science - Computational Complexity, Theory of computation → Constraint and logic programming, FOS: Mathematics, ddc:004, F.1.3, Logic (math.LO)
Dateibeschreibung: application/pdf
Zugangs-URL: http://arxiv.org/abs/2010.04618
https://drops.dagstuhl.de/opus/volltexte/2021/14451/
https://doi.org/10.4230/LIPIcs.MFCS.2021.11
https://arxiv.org/abs/2010.04618
https://drops.dagstuhl.de/opus/volltexte/2021/14451/pdf/LIPIcs-MFCS-2021-11.pdf/
https://dblp.uni-trier.de/db/journals/corr/corr2010.html#abs-2010-04618
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.11 -
17
Autoren:
Quelle: Theory & Practice of Logic Programming; Sep2018, Vol. 18 Issue 5/6, p722-724, 3p
-
18
Autoren:
Weitere Verfasser:
Schlagwörter: FOS: Computer and information sciences, Computer Science - Artificial Intelligence, Complexity, Binary Decision Diagrams, [INFO] Computer Science [cs], Computational Complexity (cs.CC), Computer Science - Computational Complexity, Artificial Intelligence (cs.AI), Bucket Elimination, Theory of computation → Constraint and logic programming, Theory of computation → Proof complexity, ddc:004, Satisfiability
Dateibeschreibung: application/pdf
-
19
Autoren:
Weitere Verfasser:
Schlagwörter: [INFO.INFO-AI] Computer Science [cs]/Artificial Intelligence [cs.AI], Computing methodologies → Temporal reasoning, spatial and temporal reasoning, Qualitative constraints, dynamic branching, adaptive algorithm, Theory of computation → Constraint and logic programming, Computing methodologies → Spatial and physical reasoning, counting local models, ddc:004
Dateibeschreibung: application/pdf
-
20
Autoren: et al.
Weitere Verfasser: et al.
Quelle: Leibniz International Proceedings in Informatics (LIPIcs) ; 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024) ; https://hal.science/hal-04784672 ; 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024), Mar 2024, Clermont- Ferrand, France. ⟨10.4230/LIPIcs.STACS.2024.11⟩
Schlagwörter: Theory of computation → Complexity theory and logic, Theory of computation → Constraint and logic programming, DNNF, dichotomy, knowledge compilation, constraint satisfaction, [INFO]Computer Science [cs]
Geographisches Schlagwort: Clermont- Ferrand, France
Relation: info:eu-repo/semantics/altIdentifier/arxiv/2311.10040; ARXIV: 2311.10040
Nájsť tento článok vo Web of Science 
Full Text Finder