Výsledky vyhledávání - (("logic and constraint programming") OR ("login and constraint programming"))

Modeling the Navārahatiguṇā Yantra Using Logic and Constraint Programming

Autoři: Kawinthalakon Phulumphai

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

Parallelizing irregular and pointer-based computations automatically: Perspectives from logic and constraint programming

Autoři: Hermenegildo, Manuel V.

Zdroj: Parallel computing, ISSN 0167-8191, 2000, Vol. 26, No. 13-14
Archivo Digital UPM
Universidad Politécnica de Madrid
instname

Témata: Informática, Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.), pointer aliasing analysis, Granularity control, irregular computations, automatic parallelization, 02 engineering and technology, Irregular computations, Logic programming, Pointer aliasing analysis, granularity control, Automatic parallelization, cost analysis, Cost analysis, 0202 electrical engineering, electronic engineering, information engineering, abstract interpretation

Popis souboru: application/pdf; application/xml

Přístupová URL adresa: http://oa.upm.es/13286/1/HERME_A_2000-1.pdf
https://oa.upm.es/13286/
http://oa.upm.es/13286/
https://dblp.uni-trier.de/db/journals/pc/pc26.html#Hermenegildo00
http://oa.upm.es/13286/1/HERME_A_2000-1.pdf
https://www.sciencedirect.com/science/article/pii/S016781910000051X

From Prolog III to Prolog IV: The Logic of Constraint Programming Revisited

Autoři: Guy A. Narboni

Zdroj: Constraints. 4:313-335

Témata: 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Přístupová URL adresa: https://link.springer.com/article/10.1023/A:1009816922431
https://dl.acm.org/citation.cfm?id=593307
https://dl.acm.org/doi/10.1023/A%3A1009816922431

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

Closures and Modules Within Linear Logic Concurrent Constraint Programming

Autoři: Haemmerlé, Rémy Fages, François Soliman, Sylvain a další

Přispěvatelé: Haemmerlé, Rémy Fages, François Soliman, Sylvain a další

Zdroj: Lecture Notes in Computer Science ISBN: 9783540770497

Témata: 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 16. Peace & justice, 01 natural sciences, [INFO.INFO-PL] Computer Science [cs]/Programming Languages [cs.PL]

Přístupová URL adresa: http://pauillac.inria.fr/~fages/Papers/HFS07fsttcs.pdf
https://hal.science/hal-01779531v1
https://link.springer.com/content/pdf/10.1007%2F978-3-540-77050-3_45.pdf
https://hal.archives-ouvertes.fr/hal-01779531
http://www.clip.dia.fi.upm.es/~remy/pub/HFS07fsttcs.pdf
https://link.springer.com/chapter/10.1007/978-3-540-77050-3_45
https://rd.springer.com/chapter/10.1007/978-3-540-77050-3_45
http://pauillac.inria.fr/~fages/Papers/HFS07fsttcs.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

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

Automatic parallelization of irregular and pointer-based computations: perspectives from logic and constraint programming

Autoři: Hermenegildo, Manuel V.

Zdroj: Euro-Par'97 Parallel Processing | Third International Euro-Par Conference | August 26-29, 1997 | Passau, Germany

Témata: Informática

Popis souboru: application/pdf

Relation: http://link.springer.com/chapter/10.1007/BFb0002715; https://oa.upm.es/14555/

Dostupnost: https://oa.upm.es/14555/

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

Automatic Parallelization of Irregular and Pointer-Based Computations: Perspectives from Logic and Constraint Programming

Autoři: Manuel Hermenegildo The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Manuel Hermenegildo The Pennsylvania State University CiteSeerX Archives

Zdroj: ftp://clip.dia.fi.upm.es/pub/papers/tutorial-europar97.ps.gz

Témata: Automatic Parallelization, Irregular Computations, Speculation, Pointer Aliasing Analysis, Task Granularity Control, Global Analysis, Abstract Interpretation

Popis souboru: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.54.1302

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.54.1302

Logic and Constraint Programming versus Concurrency / 論理・制約プログラミングと並行計算

Autoři: Kazunori UEDA 上田 和紀

Zdroj: コンピュータ ソフトウェア / Computer Software. 2008, 25(3):3-49

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