Výsledky vyhledávání - "Logic and Constraint Programming"

Incremental and Modular Context-sensitive Analysis

Autoři: ISABEL GARCIA-CONTRERAS JOSÉ F. MORALES MANUEL V. HERMENEGILDO

Zdroj: HCVS 2021 : Horn Clauses for Verification and Synthesis | 8th Workshop on Horn Clauses for Verification and Synthesis (HCVS) | 28 Mar 2021 | Luxemburgo
Archivo Digital UPM
Universidad Politécnica de Madrid
Theory and Practice of Logic Programming, ISSN 1475-3081, 2021, Vol. 21, No. 2
instname

Témata: Fixpoint algorithms, Informática, I.2.2, FOS: Computer and information sciences, I.2.3, D.2.4, F.3.1, Computer Science - Programming Languages, Incremental analysis, Program analysis, Abstract interpretation, Logic and constraint programming, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Modular analysis, 0202 electrical engineering, electronic engineering, information engineering, Constrained Horn clauses, Programming Languages (cs.PL)

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/pdf/1804.01839
http://arxiv.org/abs/1804.01839
https://oa.upm.es/70154/
https://oa.upm.es/70098/
https://www.cambridge.org/core/journals/theory-and-practice-of-logic-programming/article/incremental-and-modular-contextsensitive-analysis/E4123610FEF4488AE3F983162746CA89
https://doi.org/10.1017/S1471068420000496
https://dblp.uni-trier.de/db/journals/tplp/tplp21.html#Garcia-Contreras21
https://www.cambridge.org/core/services/aop-cambridge-core/content/view/E4123610FEF4488AE3F983162746CA89/S1471068420000496a.pdf/div-class-title-incremental-and-modular-context-sensitive-analysis-div.pdf
https://arxiv.org/abs/1804.01839
https://arxiv.org/pdf/1804.01839

VeriFly: On-the-fly Assertion Checking via Incrementality

Autoři: MIGUEL A. SANCHEZ-ORDAZ ISABEL GARCIA-CONTRERAS VICTOR PEREZ a další

Přispěvatelé: MIGUEL A. SANCHEZ-ORDAZ ISABEL GARCIA-CONTRERAS VICTOR PEREZ a další

Zdroj: Theory and Practice of Logic Programming, ISSN 1475-3081, 2021, Vol. 21, No. 6
Archivo Digital UPM
instname
Digital.CSIC. Repositorio Institucional del CSIC
Consejo Superior de Investigaciones Científicas (CSIC)
Universidad Politécnica de Madrid

Témata: Informática, FOS: Computer and information sciences, Program development environments, Computer Science - Programming Languages, On-the-fly assertion checking, Incremental analysis, 0202 electrical engineering, electronic engineering, information engineering, Abstract interpretation, Logic and constraint programming, 02 engineering and technology, Static analysis, Programming Languages (cs.PL)

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/pdf/2106.07045
http://arxiv.org/abs/2106.07045
https://oa.upm.es/70095/
http://hdl.handle.net/10261/376470
https://dblp.uni-trier.de/db/journals/corr/corr2106.html#abs-2106-07045

Implementing type theory in higher order constraint logic programming

Autoři: Guidi, Ferruccio Sacerdoti Coen, Claudio Tassi, Enrico

Přispěvatelé: Guidi, Ferruccio Sacerdoti Coen, Claudio Tassi, Enrico

Zdroj: Mathematical Structures in Computer Science. 29:1125-1150

Témata: [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], [INFO.INFO-MS] Computer Science [cs]/Mathematical Software [cs.MS], type theory, higher order constraint logic programming, logic programming, constraint programming, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 16. Peace & justice, 01 natural sciences

Popis souboru: application/pdf

Přístupová URL adresa: https://hal.inria.fr/hal-01410567/file/dalefest.pdf
https://inria.hal.science/hal-01410567v3
https://dblp.uni-trier.de/db/journals/mscs/mscs29.html#GuidiCT19
https://hal.inria.fr/hal-01410567/document
https://hal.archives-ouvertes.fr/hal-01410567v3
https://www.cambridge.org/core/journals/mathematical-structures-in-computer-science/article/implementing-type-theory-in-higher-order-constraint-logic-programming/AB210BBE8C489B129C8A09AFCB2B905F
https://hal.inria.fr/hal-01410567v2
http://journals.cambridge.org/action/displayJournal?jid=MSC
https://hdl.handle.net/11585/698621
https://doi.org/10.1017/S0960129518000427

Functional and Constraint Logic Programming: 28th International Workshop, WFLP 2020, Bologna, Italy, September 7, 2020, Revised Selected Papers

Autoři: M. Hanus C. Sacerdoti Coen

Zdroj: Lecture Notes in Computer Science ISBN: 9783030753320

Témata: Functional programming, logic programming, constraint programming, 5. Gender equality, 10. No inequality, 7. Clean energy, 3. Good health

Popis souboru: application/pdf

Přístupová URL adresa: https://cris.unibo.it/handle/11585/820039
https://hdl.handle.net/11585/820039
https://doi.org/10.1007/978-3-030-75333-7
https://link.springer.com/book/10.1007/978-3-030-75333-7

A gentle introduction to Girard's Transcendental Syntax for the linear logician

Autoři: Eng, Boris Laboratoire d'Informatique de Paris-Nord (LIPN) Centre National de la Recherche Scientifique (CNRS)-Université Sorbonne Paris Nord

Přispěvatelé: Eng, Boris Laboratoire d'Informatique de Paris-Nord (LIPN) Centre National de la Recherche Scientifique (CNRS)-Université Sorbonne Paris Nord

Zdroj: https://hal.science/hal-02977750 ; 2022.

Témata: Models of Computation, Linear Logic, Semantics, Geometry of Interaction, Realizability semantics, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages/F.3.2.1: Denotational semantics, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.0: Computability theory, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.7: Proof theory, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.3: Logic and constraint programming, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.2: Lambda calculus and related systems, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], [MATH.MATH-LO]Mathematics [math]/Logic [math.LO]

Relation: info:eu-repo/semantics/altIdentifier/arxiv/2012.04752; ARXIV: 2012.04752

Dostupnost: https://hal.science/hal-02977750
https://hal.science/hal-02977750v7/document
https://hal.science/hal-02977750v7/file/main.pdf

A Practical View on Renaming

Autoři: Marija Kulas

Zdroj: Electronic Proceedings in Theoretical Computer Science, Vol 234, Iss Proc. WLP 2015/'16/WFLP'16, Pp 27-41 (2017)

Témata: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Electronic computers. Computer science, QA1-939, 0202 electrical engineering, electronic engineering, information engineering, QA75.5-76.95, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Mathematics, F.4.1 Logic and constraint programming, Logic in Computer Science (cs.LO)

Přístupová URL adresa: https://arxiv.org/pdf/1701.00624
http://arxiv.org/abs/1701.00624
https://doaj.org/article/23487415f29640dfa04d99b31fdd6c75
https://arxiv.org/abs/1701.00624
https://dblp.uni-trier.de/db/series/eptcs/eptcs234.html#Kulas17
https://doi.org/10.4204/EPTCS.234.3
https://arxiv.org/abs/1701.00624
http://ui.adsabs.harvard.edu/abs/2017arXiv170100624K/abstract
https://arxiv.org/pdf/1701.00624.pdf

Multiplicative Linear Logic from Logic Programs and Tilings

Autoři: Eng, Boris Seiller, Thomas Laboratoire d'Informatique de Paris-Nord (LIPN) a další

Přispěvatelé: Eng, Boris Seiller, Thomas Laboratoire d'Informatique de Paris-Nord (LIPN) a další

Zdroj: https://hal.science/hal-02895111 ; 2021.

Témata: Models of Computation, Linear Logic, Semantics, Geometry of Interaction, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages/F.3.2.1: Denotational semantics, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.0: Computability theory, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.7: Proof theory, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.3: Logic and constraint programming, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.2: Lambda calculus and related systems, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], [MATH.MATH-LO]Mathematics [math]/Logic [math.LO]

Relation: info:eu-repo/semantics/altIdentifier/arxiv/2007.16077; ARXIV: 2007.16077

Dostupnost: https://hal.science/hal-02895111
https://hal.science/hal-02895111v3/document
https://hal.science/hal-02895111v3/file/main.pdf

A gentle introduction to Girard's Transcendental Syntax for the linear logician

Autoři: Eng, Boris Laboratoire d'Informatique de Paris-Nord (LIPN) Centre National de la Recherche Scientifique (CNRS)-Université Sorbonne Paris Nord

Přispěvatelé: Eng, Boris Laboratoire d'Informatique de Paris-Nord (LIPN) Centre National de la Recherche Scientifique (CNRS)-Université Sorbonne Paris Nord

Zdroj: https://hal.archives-ouvertes.fr/hal-02977750 ; 2021.

Témata: Models of Computation, Linear Logic, Semantics, Geometry of Interaction, Realizability semantics, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages/F.3.2.1: Denotational semantics, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.0: Computability theory, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.7: Proof theory, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.3: Logic and constraint programming, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.2: Lambda calculus and related systems, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], [MATH.MATH-LO]Mathematics [math]/Logic [math.LO]

Relation: info:eu-repo/semantics/altIdentifier/arxiv/2012.04752; hal-02977750; https://hal.archives-ouvertes.fr/hal-02977750; https://hal.archives-ouvertes.fr/hal-02977750v6/document; https://hal.archives-ouvertes.fr/hal-02977750v6/file/main.pdf; ARXIV: 2012.04752

Dostupnost: https://hal.archives-ouvertes.fr/hal-02977750
https://hal.archives-ouvertes.fr/hal-02977750v6/document
https://hal.archives-ouvertes.fr/hal-02977750v6/file/main.pdf

Stellar Resolution: Multiplicatives - for the linear logician, through examples

Autoři: Eng, Boris Laboratoire d'Informatique de Paris-Nord (LIPN) Institut Galilée-Université Sorbonne Paris Cité (USPC)-Centre National de la Recherche Scientifique (CNRS)-Université Sorbonne Paris Nord

Přispěvatelé: Eng, Boris Laboratoire d'Informatique de Paris-Nord (LIPN) Institut Galilée-Université Sorbonne Paris Cité (USPC)-Centre National de la Recherche Scientifique (CNRS)-Université Sorbonne Paris Nord

Zdroj: https://hal.archives-ouvertes.fr/hal-02977750 ; 2021.

Témata: Models of Computation, Linear Logic, Semantics, Geometry of Interaction, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages/F.3.2.1: Denotational semantics, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.0: Computability theory, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.7: Proof theory, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.3: Logic and constraint programming, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.2: Lambda calculus and related systems, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], [MATH.MATH-LO]Mathematics [math]/Logic [math.LO]

Relation: info:eu-repo/semantics/altIdentifier/arxiv/2012.04752; hal-02977750; https://hal.archives-ouvertes.fr/hal-02977750; https://hal.archives-ouvertes.fr/hal-02977750v4/document; https://hal.archives-ouvertes.fr/hal-02977750v4/file/main.pdf; ARXIV: 2012.04752

Dostupnost: https://hal.archives-ouvertes.fr/hal-02977750
https://hal.archives-ouvertes.fr/hal-02977750v4/document
https://hal.archives-ouvertes.fr/hal-02977750v4/file/main.pdf

Stellar Resolution: Multiplicatives

Autoři: Eng, Boris Seiller, Thomas Laboratoire d'Informatique de Paris-Nord (LIPN) a další

Přispěvatelé: Eng, Boris Seiller, Thomas Laboratoire d'Informatique de Paris-Nord (LIPN) a další

Zdroj: https://hal.archives-ouvertes.fr/hal-02895111 ; 2020.

Témata: Models of Computation, Linear Logic, Semantics, Geometry of Interaction, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages/F.3.2.1: Denotational semantics, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.0: Computability theory, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.7: Proof theory, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.3: Logic and constraint programming, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.2: Lambda calculus and related systems, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], [MATH.MATH-LO]Mathematics [math]/Logic [math.LO]

Relation: info:eu-repo/semantics/altIdentifier/arxiv/2007.16077; hal-02895111; https://hal.archives-ouvertes.fr/hal-02895111; https://hal.archives-ouvertes.fr/hal-02895111v2/document; https://hal.archives-ouvertes.fr/hal-02895111v2/file/main-HAL.pdf; ARXIV: 2007.16077

Dostupnost: https://hal.archives-ouvertes.fr/hal-02895111
https://hal.archives-ouvertes.fr/hal-02895111v2/document
https://hal.archives-ouvertes.fr/hal-02895111v2/file/main-HAL.pdf

Stellar Resolution: Multiplicatives - for the linear logician, through examples

Autoři: Eng, Boris Laboratoire d'Informatique de Paris-Nord (LIPN) Institut Galilée-Université Sorbonne Paris Cité (USPC)-Centre National de la Recherche Scientifique (CNRS)-Université Sorbonne Paris Nord

Přispěvatelé: Eng, Boris Laboratoire d'Informatique de Paris-Nord (LIPN) Institut Galilée-Université Sorbonne Paris Cité (USPC)-Centre National de la Recherche Scientifique (CNRS)-Université Sorbonne Paris Nord

Zdroj: https://hal.archives-ouvertes.fr/hal-02977750 ; 2020.

Témata: Models of Computation, Linear Logic, Semantics, Geometry of Interaction, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages/F.3.2.1: Denotational semantics, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.0: Computability theory, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.7: Proof theory, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.3: Logic and constraint programming, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.2: Lambda calculus and related systems, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], [MATH.MATH-LO]Mathematics [math]/Logic [math.LO]

Relation: hal-02977750; https://hal.archives-ouvertes.fr/hal-02977750; https://hal.archives-ouvertes.fr/hal-02977750v2/document; https://hal.archives-ouvertes.fr/hal-02977750v2/file/main.pdf

Dostupnost: https://hal.archives-ouvertes.fr/hal-02977750
https://hal.archives-ouvertes.fr/hal-02977750v2/document
https://hal.archives-ouvertes.fr/hal-02977750v2/file/main.pdf

Combining CP and ILP in a tree decomposition of bounded height for the sum colouring problem

Autoři: Minot, Maël Ndiaye, Samba Ndojh Solnon, Christine a další

Přispěvatelé: Minot, Maël Ndiaye, Samba Ndojh Solnon, Christine a další

Zdroj: International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR 2017) ; https://hal.science/hal-01447818 ; International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR 2017), Jun 2017, Padova, Italy. pp.359-375 ; http://cpaior2017.dei.unipd.it/

Témata: Tree decomposition, Graphs, Integer linear programming, Constraint programming, Sum colouring problem, Colouring, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.3: Logic and constraint programming, ACM: G.: Mathematics of Computing/G.1: NUMERICAL ANALYSIS/G.1.6: Optimization/G.1.6.4: Integer programming, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory, ACM: I.: Computing Methodologies/I.2: ARTIFICIAL INTELLIGENCE, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI]

Geografické téma: Italy

Time: Padova, Italy

Dostupnost: https://hal.science/hal-01447818
https://hal.science/hal-01447818v2/document
https://hal.science/hal-01447818v2/file/article_cpaior_2017_mm.pdf

An evaluation of complete approaches for the sum colouring problem ; Évaluation d'approches complètes pour le problème de somme coloration ; An evaluation of complete approaches for the sum colouring problem: Extended version ; Évaluation d'approches complètes pour le problème de somme coloration: Version étendue

Autoři: Minot, Maël Ndiaye, Samba Ndojh Solnon, Christine a další

Přispěvatelé: Minot, Maël Ndiaye, Samba Ndojh Solnon, Christine a další

Zdroj: JFPC 2016 – Douzièmes Journées Francophones de Programmation par Contraintes ; Douzièmes Journées Francophones de Programmation par Contraintes (JFPC 2016) ; https://hal.science/hal-01309350 ; Douzièmes Journées Francophones de Programmation par Contraintes (JFPC 2016), Jun 2016, Montpellier, France. pp.1-10 ; https://www.supagro.fr/jfpc_jiaf_2016/index_jfpc.php

Témata: complete approaches, variable choice heuristics, CSP, graphs, sum colouring, approches complètes, somme coloration, graphes, heuristiques de choix de variables, ACM: G.: Mathematics of Computing/G.1: NUMERICAL ANALYSIS/G.1.6: Optimization/G.1.6.0: Constrained optimization, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.3: Logic and constraint programming, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI]

Geografické téma: Montpellier, France

Dostupnost: https://hal.science/hal-01309350
https://hal.science/hal-01309350v1/document
https://hal.science/hal-01309350v1/file/jfpc_mm_2016.pdf

Modelos de constraint programming para el problema de diseñar el fixture de las ligas de básquet de Argentina

Autoři: Delle Donne, Diego Di Pasquale, Ricardo Durand, Guillermo a další

Témata: Ciencias Informáticas, programación entera, Logic and constraint programming

Popis souboru: application/pdf

Relation: http://sedici.unlp.edu.ar/handle/10915/58470

Dostupnost: http://sedici.unlp.edu.ar/handle/10915/58470

Guaranteed Weighted Counting for Affinity Computation: Beyond Determinism and Structure

Autoři: Viricel, Clement Simoncini, David Barbe, Sophie a další

Přispěvatelé: Viricel, Clement Simoncini, David Barbe, Sophie a další

Zdroj: Proceedings of the 22nd International Conference on the Principles and Practice of Constraint Programming ; CP16 - 22nd International Conference on the Principles and Practice of Constraint Programming ; https://hal.science/hal-01828389 ; CP16 - 22nd International Conference on the Principles and Practice of Constraint Programming, Sep 2016, Toulouse, France. pp.18, ⟨10.1007/978-3-319-44953-1_46⟩

Témata: PROTEIN DESIGN, MAX-SAT, ELIMINATION, OPTIMIZATION, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.3: Logic and constraint programming, [INFO.INFO-BI]Computer Science [cs]/Bioinformatics [q-bio.QM], [STAT.AP]Statistics [stat]/Applications [stat.AP], [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC]

Geografické téma: Toulouse, France

Relation: info:eu-repo/grantAgreement/EC/FP7/267196/EU/International Mobility Programme to Strengthen Skills and Excellence in Research for Agriculture/AGREENSKILLS; hal-01828389; https://hal.science/hal-01828389; https://hal.science/hal-01828389/document; https://hal.science/hal-01828389/file/CP2016.pdf; PRODINRA: 383299; WOS: 000389019700047

Dostupnost: https://hal.science/hal-01828389
https://hal.science/hal-01828389/document
https://hal.science/hal-01828389/file/CP2016.pdf
https://doi.org/10.1007/978-3-319-44953-1_46

Constraint satisfaction tractability from semi-lattice operations on infinite sets

Autoři: Bodirsky, Manuel Macpherson, Dugald Thapper, Johan a další

Přispěvatelé: Bodirsky, Manuel Macpherson, Dugald Thapper, Johan a další

Zdroj: ACM Transactions on Computational Logic

Témata: [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], FOS: Computer and information sciences, ω-categoricity, Discrete Mathematics (cs.DM), Mathematics - Logic, 0102 computer and information sciences, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], Computational Complexity (cs.CC), semi-lattice operations, 01 natural sciences, Computational complexity, [MATH.MATH-LO]Mathematics [math]/Logic [math.LO], Computer Science - Computational Complexity, Mathematical Logic—Logic and constraint programming, FOS: Mathematics, F.4.1, Model theory, Theory, 0101 mathematics, constraint satisfaction problems, Logic (math.LO), Algorithms, Computer Science - Discrete Mathematics

Přístupová URL adresa: http://arxiv.org/pdf/1111.6616
http://arxiv.org/abs/1111.6616
https://arxiv.org/abs/1111.6616
https://dl.acm.org/doi/10.1145/2528933
https://core.ac.uk/display/23555794
https://hal.archives-ouvertes.fr/hal-00756929/document
https://hal.archives-ouvertes.fr/hal-00756929
https://arxiv.org/pdf/1111.6616v1

An Algebraic View of Space/Belief and Extrusion/Utterance for Concurrency/Epistemic Logic

Autoři: Haar, Stefan Perchy, Salim Rueda, Camilo a další

Přispěvatelé: Haar, Stefan Perchy, Salim Rueda, Camilo a další

Zdroj: 17th International Symposium on Principles and Practice of Declarative Programming (PPDP 2015)
https://inria.hal.science/hal-01256984
17th International Symposium on Principles and Practice of Declarative Programming (PPDP 2015), Jul 2015, Siena, Italy. pp.161-172, ⟨10.1145/2790449.2790520⟩

Témata: Mobility, Space, Extrusion, Utterance, Social Networks, Lies, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.5: Modal logic, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.3: Logic and constraint programming, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], [MATH.MATH-LO]Mathematics [math]/Logic [math.LO], [MATH.MATH-GN]Mathematics [math]/General Topology [math.GN], [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], [INFO.INFO-SI]Computer Science [cs]/Social and Information Networks [cs.SI]

Geografické téma: Siena, Italy

Dostupnost: https://inria.hal.science/hal-01256984
https://inria.hal.science/hal-01256984v1/document
https://inria.hal.science/hal-01256984v1/file/mccp-ppdp-author-copy.pdf
https://doi.org/10.1145/2790449.2790520

Hybridation de programmation linéaire et de programmation par contraintes pour le problème de déplacement de conteneurs

Autoři: Demassey, Sophie Feillet, Dominique Centre de Mathématiques Appliquées (CMA) a další

Přispěvatelé: Demassey, Sophie Feillet, Dominique Centre de Mathématiques Appliquées (CMA) a další

Zdroj: ROADEF'15 - 16ème congrès annuel de la Société française de Recherche Opérationnelle et d'Aide à la Décision ; https://hal.science/hal-01109049 ; ROADEF'15 - 16ème congrès annuel de la Société française de Recherche Opérationnelle et d'Aide à la Décision, Feb 2015, Marseille, France

Témata: Container Relocation Problem, Programmation par contraintes, Programmation linéaire en Nombres Entiers, ACM: G.: Mathematics of Computing/G.1: NUMERICAL ANALYSIS/G.1.6: Optimization/G.1.6.4: Integer programming, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.3: Logic and constraint programming, [INFO.INFO-RO]Computer Science [cs]/Operations Research [math.OC]

Geografické téma: Marseille, France

Dostupnost: https://hal.science/hal-01109049
https://hal.science/hal-01109049v1/document
https://hal.science/hal-01109049v1/file/demassey15roadef.pdf

A Framework for Defining Logical Frameworks

Autoři: HONSELL, Furio LENISA, Marina LIQUORI LUIGI a další

Přispěvatelé: HONSELL, Furio LENISA, Marina LIQUORI LUIGI a další

Zdroj: Electronic Notes in Theoretical Computer Science. 172:399-436

Témata: [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], Dependent-type systems, Lambda calculus, Logical Framework, Logics, Pattern matching, Logic and constraint programming, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Formal Definitions and Theory: Syntax and Semantics, Theoretical Computer Science, Lambda calculus and related systems, Constraint and logic languages Category, [INFO.INFO-CL] Computer Science [cs]/Computation and Language [cs.CL], Language Classifications: Applicative (functional) languages, 0202 electrical engineering, electronic engineering, information engineering, Mechanical theorem proving, Computer Science(all)

Popis souboru: application/pdf

Přístupová URL adresa: https://inria.hal.science/hal-01148312v1/document
https://doi.org/10.1016/j.entcs.2007.02.014
https://inria.hal.science/hal-01148312v1
https://hal.inria.fr/hal-01148312/document
https://dblp.uni-trier.de/db/journals/entcs/entcs172.html#HonsellLL07
https://www-sop.inria.fr/members/Luigi.Liquori/PAPERS/Plotkin.pdf
https://hal.inria.fr/inria-00088809
https://users.dimi.uniud.it/~marina.lenisa/Papers/Soft-copy-pdf/plo07.pdf
https://www.sciencedirect.com/science/article/pii/S1571066107000862

Chart Parsing Multimodal Grammars

Autoři: Moot, Richard Exploration et exploitation de données textuelles (TEXTE) Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM) a další

Přispěvatelé: Moot, Richard Exploration et exploitation de données textuelles (TEXTE) Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM) a další

Zdroj: https://hal-lirmm.ccsd.cnrs.fr/lirmm-01759945 ; [Technical Report] LIRMM (UM, CNRS); Université de Montpellier. 2018.

Témata: Logic programming, Deductive parsing, Categorial grammar, Type-logical grammar, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.3: Logic and constraint programming, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.7: Proof theory, ACM: I.: Computing Methodologies/I.2: ARTIFICIAL INTELLIGENCE/I.2.3: Deduction and Theorem Proving/I.2.3.3: Logic programming, ACM: I.: Computing Methodologies/I.2: ARTIFICIAL INTELLIGENCE/I.2.7: Natural Language Processing/I.2.7.3: Language parsing and understanding, [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL]

Relation: info:eu-repo/semantics/altIdentifier/arxiv/1804.02286; ARXIV: 1804.02286

Dostupnost: https://hal-lirmm.ccsd.cnrs.fr/lirmm-01759945
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01759945v1/document
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01759945v1/file/chart_paper.pdf