No Cliques Allowed: The Next Step Towards BDD/FC Conjecture

Συγγραφείς: Larroque, Lucas, Ostropolski-Nalewaja, Piotr, Thomazo, Michaël

Συνεισφορές: Thomazo, Michaël

Πηγή: Proceedings of the ACM on Management of Data. 3:1-20

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: https://inria.hal.science/hal-05273623v1/document
https://inria.hal.science/hal-05273623v1
https://doi.org/10.1145/3725238

A new Constraint Programming model for the Multiple Constant Multiplication

Συγγραφείς: Cantaloube, Théo, Peng, Xiao, Solnon, Christine, Volkova, Anastasia

Συνεισφορές: Solnon, Christine

Θεματικοί όροι: Hardware Optimization, Constraint and logic programming, [INFO] Computer Science [cs], Multiple Constant Multiplication, Constraint Programming, Theory of computation

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: https://hal.science/hal-05251229v1

Complexity of minimum-size arc-inconsistency explanations

Συγγραφείς: Bessiere, Christian, Carbonnel, Clément, Cooper, Martin C., Hebrard, Emmanuel

Συνεισφορές: Christian Bessiere and Clément Carbonnel and Martin C. Cooper and Emmanuel Hebrard, Gouat, Isabelle, Carbonnel, Clément, Solnon, Christine, Agents, Apprentissage, Contraintes (LIRMM, Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM), Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM), Université de Toulouse (UT), Institut de recherche en informatique de Toulouse (IRIT), Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université de Toulouse (UT)-Toulouse Mind & Brain Institut (TMBI), Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Argumentation, Décision, Raisonnement, Incertitude et Apprentissage (IRIT-ADRIA), Université de Toulouse (UT)-Université Toulouse Capitole (UT Capitole), Équipe Recherche Opérationnelle, Optimisation Combinatoire et Contraintes (LAAS-ROC), Laboratoire d'analyse et d'architecture des systèmes (LAAS), Université de Toulouse (UT)-Université de Toulouse (UT)-Institut National des Sciences Appliquées - Toulouse (INSA Toulouse), Institut National des Sciences Appliquées (INSA)-Université de Toulouse (UT)-Institut National des Sciences Appliquées (INSA)-Université de Toulouse (UT)-Université Toulouse - Jean Jaurès (UT2J), ANR-19-P3IA-0004,ANITI,Artificial and Natural Intelligence Toulouse Institute(2019), European Project: 101070149,TUPLES, European Project: 952215,TAILOR(2020)

Πηγή: Constraints. 28:427-449

Θεματικοί όροι: [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

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2022.9
https://hal-lirmm.ccsd.cnrs.fr/lirmm-03833388v1
https://hal-lirmm.ccsd.cnrs.fr/lirmm-03833388v1/document
https://doi.org/10.4230/lipics.cp.2022.9

SAT-Inspired Eliminations for Superposition

Συγγραφείς: Vukmirović, Petar, Blanchette, Jasmin, Heule, Marijn

Συνεισφορές: Blanchette, Jasmin

Πηγή: 21st International Conference on Formal Methods in Computer-Aided Design (FMCAD 2021)

Θεματικοί όροι: superposition calculus, [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], SAT solving, formal methods, hardware and system verification, formale Methode, Theory of computation → Automated reasoning, rechnerunterstützte Systementwicklung, 02 engineering and technology, [INFO] Computer Science [cs], CCS Concepts: Theory of computation → Automated reasoning Logic and verification Constraint and logic programming Theorem proving, Hardwareverifikation, CCS Concepts, Constraint and logic programming Theorem proving, 0202 electrical engineering, electronic engineering, information engineering, Logic and verification, computer-aided system design, Theorem proving, first-order logic

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: https://research.vu.nl/en/publications/593885b3-4f56-4c70-ac7b-c9e90a040e25
https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_32
https://hdl.handle.net/1871.1/593885b3-4f56-4c70-ac7b-c9e90a040e25
https://hdl.handle.net/1871.1/2d1c8438-6ae4-4102-acdc-b0671fc22cda
https://doi.org/10.1145/3565366
https://research.vu.nl/en/publications/2d1c8438-6ae4-4102-acdc-b0671fc22cda
https://inria.hal.science/hal-03485200v1/document
https://inria.hal.science/hal-03485200v1
https://doi.org/10.5281/zenodo.4552499
https://inria.hal.science/hal-04298574v1
https://doi.org/10.1145/3565366
https://inria.hal.science/hal-04298574v1/document

Mono Types - First-Class Containers for Datalog

Συγγραφείς: Xu, Runqing, Klopp, David, Erdweg, Sebastian, Aldrich, Jonathan, Silva, Alexandra

Θεματικοί όροι: Datalog, compiler optimization, Theory of computation → Constraint and logic programming, ddc:004, DATA processing & computer science, info:eu-repo/classification/ddc/004

Περιγραφή αρχείου: 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

Διαθεσιμότητα: https://publikationen.bibliothek.kit.edu/1000187537
https://publikationen.bibliothek.kit.edu/1000187537/170103974
https://doi.org/10.5445/IR/1000187537/v2

Logic and Neural Networks (Dagstuhl Seminar 25061)

Συγγραφείς: Belle, Vaishak, Benedikt, Michael, Drachsler-Cohen, Dana, Neider, Daniel, Yuviler, Tom, Yang, Hongseok, Barceló, Pablo, Raedt, Luc De, Geerts, Floris, Girard-Satabin, Julien, Giunchiglia, Eleonora, Lukina, Anna, Meyer, Pierre-Jean, Ritzert, Martin, Singh, Gagandeep, Solar-Lezama, Armando, Stoian, Mihaela, Tena, David, Urban, Caterina, Zombori, Zsolt, van Krieken, Emile

Συνεισφορές: Girard-Satabin, Julien

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: https://hal.science/hal-05311341v1/document
https://doi.org/10.4230/dagrep.15.2.1
https://hal.science/hal-05311341v1

Linearly Ordered Colourings of Hypergraphs

Συγγραφείς: Nakajima, Tamio-Vesa, Živný, Stanislav

Συνεισφορές: Tamio-Vesa Nakajima and Stanislav Živný, Bojańczyk, Mikołaj, Merelli, Emanuela, Woodruff, David P.

Πηγή: ACM Transactions on Computation Theory. 14:1-19

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: 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

User Guided Abductive Proof Generation for Answer Set Programming Queries

Συγγραφείς: MAHAJAN, Avishkar, STRECKER, Martin, WONG, Meng Weng (HUANG Mingrong)

Πηγή: Proceedings of the 24th International Symposium on Principles and Practice of Declarative Programming. :1-14

Θεματικοί όροι: Programming Languages and Compilers, Applied computing, 0202 electrical engineering, electronic engineering, information engineering, Constraint and logic programming, Automated reasoning, 0102 computer and information sciences, 02 engineering and technology, Science and Technology Law, 16. Peace & justice, Law, 01 natural sciences, Theory of computation

Περιγραφή αρχείου: application/pdf

The Complexity of Promise SAT on Non-Boolean Domains

Συγγραφείς: Brandts, Alex, Wrochna, Marcin, Živný, Stanislav

Συνεισφορές: Alex Brandts and Marcin Wrochna and Stanislav Živný, Artur Czumaj, Anuj Dawar, Emanuela Merelli

Πηγή: ACM Transactions on Computation Theory
47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: 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

The Combined Basic LP and Affine IP Relaxation for Promise VCSPs on Infinite Domains

Συγγραφείς: Viola, Caterina, Živný, Stanislav

Συνεισφορές: Caterina Viola and Stanislav Živný, Javier Esparza, Daniel Kráľ

Πηγή: 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)
ACM Transactions on Algorithms

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: 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

Coupling CP with Deep Learning for Molecular Design and SARS-CoV2 Variants Exploration

Συγγραφείς: Schiex, Thomas

Συνεισφορές: Schiex, Thomas

Θεματικοί όροι: random Markov fields, [INFO.INFO-AI] Computer Science [cs]/Artificial Intelligence [cs.AI], constraint programming, Computing methodologies → Learning graphical models, deep learning, constraint programming, cost function networks, random Markov fields, decision-focused learning, protein design .CP.2023, decision-focused learning, 2012 ACM Subject Classification Computing methodologies → Artificial intelligence, deep learning, 2012 ACM Subject Classification Computing methodologies → Artificial intelligence Computing methodologies → Machine learning Theory of computation → Constraint and logic programming Computing methodologies → Learning graphical models, deep learning, constraint programming, cost function networks, random Markov fields, decision-focused learning, protein design .CP.2023, [INFO] Computer Science [cs], Computing methodologies → Artificial intelligence, [INFO.INFO-BT] Computer Science [cs]/Biotechnology, Computing methodologies → Machine learning, Computing methodologies → Learning in probabilistic graphical models, graphical models, cost function networks, Theory of computation → Constraint and logic programming, protein design, [INFO.INFO-BI] Computer Science [cs]/Bioinformatics [q-bio.QM]

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: https://hal.inrae.fr/hal-04556854v1
https://hal.inrae.fr/hal-04556854v1/document

Partially Preemptive Multi Skill/Mode Resource-Constrained Project Scheduling with Generalized Precedence Relations and Calendars

Συγγραφείς: Povéda, Guillaume, Alvarez, Nahum, Artigues, Christian

Συνεισφορές: Guillaume Povéda and Nahum Alvarez and Christian Artigues, Artigues, Christian

Θεματικοί όροι: large neighborhood search, constraint programming, Applied computing → Industry and manufacturing, 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, Large-scale scheduling problem, [INFO.INFO-RO] Computer Science [cs]/Operations Research [math.OC], multi-mode, Theory of computation → Constraint and logic programming, Theory of computation → Optimization with randomized search heuristics, Computing methodologies → Planning and scheduling, Theory of computation → Constraint and logic programming phrases Large-scale scheduling problem, partial preemption, multi-skill, ddc:004, resource calendars

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2023.31
https://laas.hal.science/hal-04217223v1/document
https://doi.org/10.4230/lipics.cp.2023.31
https://laas.hal.science/hal-04217223v1

MDD Archive for Boosting the Pareto Constraint

Συγγραφείς: Malalel, Steve, Malapert, Arnaud, Pelleau, Marie, Régin, Jean-Charles

Συνεισφορές: Université Côte d'Azur (UniCA), This work has been supported by the French government, through the 3IA Côte d’Azur Investments in the Future project managed by the National Research Agency (ANR) with the reference number ANR-19-P3IA-0002., Yap, Roland H. C., ANR-19-P3IA-0002,3IA@cote d'azur,3IA Côte d'Azur(2019)

Πηγή: 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⟩

Θεματικοί όροι: 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]

Θέμα γεωγραφικό: Toronto

Time: Toronto, Canada

Διαθεσιμότητα: https://hal.science/hal-04241596
https://hal.science/hal-04241596v1/document
https://hal.science/hal-04241596v1/file/LIPIcs-CP-2023-24.pdf
https://doi.org/10.4230/LIPIcs.CP.2023.24

An Efficient Constraint Programming Approach to Preemptive Job Shop Scheduling

Συγγραφείς: Juvin, Carla, Hebrard, Emmanuel, Houssin, Laurent, Lopez, Pierre

Συνεισφορές: Carla Juvin and Emmanuel Hebrard and Laurent Houssin and Pierre Lopez, Hebrard, Emmanuel

Θεματικοί όροι: Scheduling, Preemptive Resources, Theory of computation → Constraint and logic programming, Computing methodologies → Planning and scheduling, [INFO] Computer Science [cs], ddc:004, Constraint Programming

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2023.19

Binary Non-Termination in Term Rewriting and Logic Programming

Συγγραφείς: Payet, Etienne

Συνεισφορές: Payet, Etienne, Akihisa Yamada

Θεματικοί όροι: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Computer and information sciences, [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], Logic Programming, Logic in Computer Science, Constraint and logic programming, Program analysis phrases Non-Termination, Term Rewriting, Theory of computation, Rewrite systems, Logic in Computer Science (cs.LO)

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2307.11549
https://hal.univ-reunion.fr/hal-04315644v1/document
https://hal.univ-reunion.fr/hal-04315644v1
https://doi.org/10.48550/arxiv.2307.11549

Bounds on BDD-Based Bucket Elimination

Συγγραφείς: Mengel, Stefan

Συνεισφορές: Mengel, Stefan, Meena Mahajan, Friedrich Slivovsky, Stefan Mengel

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2306.00886
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAT.2023.16

Prime Scenarios in Qualitative Spatial and Temporal Reasoning

Συγγραφείς: Salhi, Yakoub, Sioutis, Michael

Συνεισφορές: Université d'Artois (UA), Centre de Recherche en Informatique de Lens (CRIL), Université d'Artois (UA)-Centre National de la Recherche Scientifique (CNRS), Agents, Apprentissage, Contraintes (LIRMM, Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM), Université de Perpignan Via Domitia (UPVD)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)-Université de Montpellier Paul-Valéry (UMPV)-Université de Perpignan Via Domitia (UPVD)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)-Université de Montpellier Paul-Valéry (UMPV)

Πηγή: TIME 2023 - 30th International Symposium on Temporal Representation and Reasoning ; https://univ-artois.hal.science/hal-04285264 ; TIME 2023 - 30th International Symposium on Temporal Representation and Reasoning, Sep 2023, Athènes, Greece. pp.5:1-5:14, ⟨10.4230/LIPIcs.TIME.2023.5⟩

Θεματικοί όροι: Spatial and Temporal Reasoning, Qualitative Constraints, Prime Scenario, Prime Implicant, Robustness Measurement, Constraint and logic programming, Temporal reasoning, Spatial and physical reasoning, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI]

Θέμα γεωγραφικό: Athènes, Greece

Διαθεσιμότητα: https://univ-artois.hal.science/hal-04285264
https://univ-artois.hal.science/hal-04285264v1/document
https://univ-artois.hal.science/hal-04285264v1/file/LIPIcs.TIME.2023.5.pdf
https://doi.org/10.4230/LIPIcs.TIME.2023.5

Embarrassingly Greedy Inconsistency Resolution of Qualitative Constraint Networks

Συγγραφείς: Sioutis, Michael

Συνεισφορές: Agents, Apprentissage, Contraintes (LIRMM, Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM), Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)

Πηγή: TIME 2023 - 30th International Symposium on Temporal Representation and Reasoning ; https://hal.science/hal-04290605 ; TIME 2023 - 30th International Symposium on Temporal Representation and Reasoning, Sep 2023, Athènes, Greece. pp.12:1-12:12, ⟨10.4230/LIPICS.TIME.2023.12⟩

Θεματικοί όροι: Temporal reasoning, Spatial and Temporal Reasoning, Qualitative Constraints, Inconsistency Resolution, Maximizing Satisfiability, Greedy Algorithm, Partial MaxSAT Solver, Constraint and logic programming, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI]

Θέμα γεωγραφικό: Athènes, Greece

Διαθεσιμότητα: https://hal.science/hal-04290605
https://hal.science/hal-04290605v1/document
https://hal.science/hal-04290605v1/file/LIPIcs.TIME.2023.12.pdf
https://doi.org/10.4230/LIPICS.TIME.2023.12

Analyzing Self-Stabilization of Synchronous Unison via Propositional Satisfiability

Συγγραφείς: Khoualdia, Asma, Cherif, Sami, Devismes, Stéphane, Robert, Léo

Συνεισφορές: Modélisation, Information et Systèmes - UR UPJV 4290 (MIS), Université de Picardie Jules Verne (UPJV), ANR-22-CE25-0008,SKYDATA,Un nouveau paradigme de donnée: Les données autononomes et intelligentes(2022), ANR-24-CE23-6126,BforSAT,Branchement pour SAT et au-delà(2024)

Πηγή: 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⟩

Θεματικοί όροι: 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]

Θέμα γεωγραφικό: Glasgow, United Kingdom

Διαθεσιμότητα: https://hal.science/hal-05203873
https://doi.org/10.4230/LIPIcs.CP.2025.19

Declarative Data Analysis Using Limit Datalog Programs

Συγγραφείς: Kostylev, Egor V.^Aff10

Συνεισφορές: Goos, Gerhard, Founding Editor^Aff1, Hartmanis, Juris, Founding Editor^Aff2, Bertino, Elisa, Editorial Board Member^Aff3, Gao, Wen, Editorial Board Member^Aff4, Steffen, Bernhard, Editorial Board Member^Aff5, Woeginger, Gerhard, Editorial Board Member^Aff6, Yung, Moti, Editorial Board Member^Aff7, Manna, Marco, editor^Aff8, Pieris, Andreas, editor^Aff9

Πηγή: Reasoning Web. Declarative Artificial Intelligence : 16th International Summer School 2020, Oslo, Norway, June 24–26, 2020, Tutorial Lectures. 12258:186-222