Search Results - "[INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO]"

Source: Stark, K. (ed.), CPP '25: 14th ACM SIGPLAN International Conference on Certified Programs and Proofs Denver CO USA January 20-21, 2025, pp. 34-49

Subject Terms: [MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO], Computer Science - Logic in Computer Science, [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], Software Science, Mathematics - Combinatorics, F.3.2, Mathematics - Category Theory, F.3.1, [MATH.MATH-CT] Mathematics [math]/Category Theory [math.CT]

File Description: application/pdf

Access URL: http://arxiv.org/abs/2412.08362
https://hdl.handle.net/2066/316735
https://repository.ubn.ru.nl//bitstream/handle/2066/316735/316735.pdf

View record at OpenAIRE

8

Academic Journal

Detecting Misleading Information with LLMs and Explainable ASP

Authors: Nguyen, Quang-Anh, Pham, Thu-Trang, Vuong, Thi-Hai-Yen, Trinh, Van-Giang, Thanh, Nguyen

Contributors: Trinh, Van-Giang

Source: Proceedings of the 17th International Conference on Agents and Artificial Intelligence. :1327-1334

Subject Terms: LLM, [INFO.INFO-AI] Computer Science [cs]/Artificial Intelligence [cs.AI], ASP, [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], misleading information detection, explainability

File Description: application/pdf

9

Academic Journal

Graphical Analysis of Abstract Argumentation Frameworks via Boolean Networks

Authors: Trinh, Van-Giang, Benhamou, Belaid, Risch, Vincent

Contributors: Trinh, Van-Giang

Source: Proceedings of the 17th International Conference on Agents and Artificial Intelligence. :745-756

Subject Terms: [INFO.INFO-AI] Computer Science [cs]/Artificial Intelligence [cs.AI], Extension-Based Semantics, [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], Abstract Argumentation Framework, [MATH.MATH-DS] Mathematics [math]/Dynamical Systems [math.DS], Graphical Analysis, Boolean Network

File Description: application/pdf

Access URL: https://inria.hal.science/hal-04917990v1/document
https://inria.hal.science/hal-04917990v1
https://doi.org/10.5220/0013346400003890

View record at OpenAIRE

10

Conference

Weakly-sparse and strongly flip-flat classes of graphs are uniformly almost-wide

Authors: Ghasemi, Fatemeh, Grange, Julien, Kanté, Mamadou Moustapha, Madelaine, Florent

Contributors: Kanté, Mamadou

Subject Terms: [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], Almost-wide, Flip-flatness

Access URL: https://hal.science/hal-05332862v1

11

Academic Journal

Teaching Divisibility and Binomials with Coq

Authors: Boldo, Sylvie, Clément, François, Hamelin, David, Mayero, Micaela, Rousselin, Pierre

Contributors: Clement, Francois

Source: Electronic Proceedings in Theoretical Computer Science. 419:124-139

Subject Terms: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], Arithmetic, 4. Education, Divisibility, [SHS.EDU] Humanities and Social Sciences/Education, Feuille d'exercices, Coefficient binomial, Logic in Computer Science (cs.LO), Divisibilité, Binomial coefficient, Coq, Arithmétique, Worksheet

File Description: application/pdf

Access URL: http://arxiv.org/abs/2404.12676
https://inria.hal.science/hal-04550762v2
https://inria.hal.science/hal-04550762v2/document
https://hal.science/hal-04725586v3
https://hal.science/hal-04725586v3/document
https://doi.org/10.4204/eptcs.419.8
https://hal.science/hal-04725586v2
https://hal.science/hal-04725586v2/document

View record at OpenAIRE Full Text Finder

12

Book

Designing a Safe Forward Chaining Tactic Using Productive Proofs

Authors: Kaustuv Chaudhuri, Arunava Gantait, Dale Miller

Contributors: Chaudhuri, Kaustuv, Gian Luca Pozzato, Tarmo Uustalu

Source: Lecture Notes in Computer Science ISBN: 9783032060846

Subject Terms: [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO]

File Description: application/pdf

Access URL: https://inria.hal.science/hal-05157939v1

View record at OpenAIRE

13

Academic Journal

Distributed controller synthesis for deadlock avoidance

Authors: Gimbert, Hugo, Mascle, Corto, Muscholl, Anca, Walukiewicz, Igor

Contributors: Hugo Gimbert and Corto Mascle and Anca Muscholl and Igor Walukiewicz, Walukiewicz, Igor

Source: Logical Methods in Computer Science. 21

Subject Terms: FOS: Computer and information sciences, [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], Logic in Computer Science, 0102 computer and information sciences, 02 engineering and technology, lock synchronisation, deadlock avoidance, concurrent systems, 01 natural sciences, Distributed Synthesis, Logic in Computer Science (cs.LO), Deadlock Avoidance, Lock Synchronisation, Concurrency, 0202 electrical engineering, electronic engineering, information engineering, ddc:004

File Description: application/pdf

Access URL: http://arxiv.org/abs/2204.12409
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2022.125
https://hal.science/hal-03808894v1
https://hal.science/hal-03808894v1/document
https://doi.org/10.4230/lipics.icalp.2022.125

View record at OpenAIRE Full Text Finder

14

Academic Journal

Gröbner Bases for Boolean Function Minimization

Authors: Faroß, Nicolas, Schwarz, Simon

Contributors: Weidenbach, Christoph

Source: Mathematics in Computer Science. 19

Subject Terms: Multi-level Logic Optimization, [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], Boolean Function Synthesis, Gröbner Bases, Multi-level Logic Optimization Boolean Function Synthesis Gröbner Bases

File Description: application/pdf

Access URL: https://inria.hal.science/hal-04315477v1

View record at OpenAIRE

15

Academic Journal

A Curry-Howard Correspondence for Linear, Reversible Computation

Authors: Chardonnet, Kostia, Saurin, Alexis, Valiron, Benoît

Contributors: Saurin, Alexis, Kostia Chardonnet and Alexis Saurin and Benoît Valiron

Source: Logical Methods in Computer Science. 21

Subject Terms: FOS: Computer and information sciences, Theory of computation → Linear logic, [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], Logic in Computer Science, Curry-Howard, 0102 computer and information sciences, 02 engineering and technology, Linear Logic, 01 natural sciences, Logic in Computer Science (cs.LO), Reversible Computation, 0202 electrical engineering, electronic engineering, information engineering, Theory of computation → Equational logic and rewriting, ddc:004

File Description: application/pdf

Access URL: http://arxiv.org/abs/2302.11887
https://hal.science/hal-04308283v1/document
https://doi.org/10.4230/lipics.csl.2023.13
https://hal.science/hal-04308283v1
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2023.13

View record at OpenAIRE Full Text Finder

16

Academic Journal

All Your Base Are Belong to Us: Sort Polymorphism for Proof Assistants: Sort Polymorphism for Proof Assistants

Authors: Josselin Poiret, Gaëtan Gilbert, Kenji Maillard, Pierre-Marie Pédrot, Matthieu Sozeau, Nicolas Tabareau, Éric Tanter

Contributors: Poiret, Josselin

Source: Proceedings of the ACM on Programming Languages. 9:2253-2281

Subject Terms: [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], proof assistants, Theory of computation → Type theory type theory, type theory

File Description: application/pdf

Access URL: https://nantes-universite.hal.science/hal-04801739v1/document
https://nantes-universite.hal.science/hal-04801739v1
https://doi.org/10.1145/3704912

View record at OpenAIRE Full Text Finder

17

Academic Journal

CATEGORICAL FOUNDATIONS OF FORMALIZED CONDENSED MATHEMATICS

Authors: DAGUR ASGEIRSSON, RICCARDO BRASCA, NIKOLAS KUHN, FILIPPO ALBERTO EDOARDO NUCCIO MORTARINO MAJNO DI CAPRIGLIO, ADAM TOPAZ

Contributors: Nuccio Mortarino Majno di Capriglio, Filippo Alberto Edoardo, University of Copenhagen = Københavns Universitet (UCPH), Institut de Mathématiques de Jussieu - Paris Rive Gauche (IMJ-PRG (UMR_7586)), Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Université Paris Cité (UPCité), University of Oslo (UiO), Institut Camille Jordan (ICJ), École Centrale de Lyon (ECL), Université de Lyon-Université de Lyon-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université Jean Monnet - Saint-Étienne (UJM)-Centre National de la Recherche Scientifique (CNRS), Université Jean Monnet - Saint-Étienne (UJM), Combinatoire, théorie des nombres (CTN), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université Jean Monnet - Saint-Étienne (UJM)-Centre National de la Recherche Scientifique (CNRS)-École Centrale de Lyon (ECL), University of Alberta, CPH-GEOTOP DNRF151, NSERC discovery grant RGPIN-2019-04762, Research Council of Norway grant 302277– Orthogonal gauge duality and non-commutative geometry, ANR-10-LABX-0070,MILYON,Community of mathematics and fundamental computer science in Lyon(2010)

Source: The Journal of Symbolic Logic. :1-28

Subject Terms: FOS: Computer and information sciences, MSC 18F10, Computer Science - Logic in Computer Science, [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], Formalization of Mathematics, Formal Languages and Automata Theory (cs.FL), [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], Mathematics - Category Theory, Computer Science - Formal Languages and Automata Theory, [MATH.MATH-CT] Mathematics [math]/Category Theory [math.CT], 01 natural sciences, Proof Assistant Lean, Logic in Computer Science (cs.LO), [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL], FOS: Mathematics, Category Theory (math.CT), Condensed Mathematics, 0101 mathematics, Grothendieck Topos, [MATH.MATH-CT]Mathematics [math]/Category Theory [math.CT], Category theory, [INFO.INFO-FL] Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]

File Description: application/pdf

Access URL: http://arxiv.org/abs/2407.12840
https://hal.science/hal-04633614v2
https://hal.science/hal-04633614v2/document
https://doi.org/10.1017/jsl.2024.69

View record at OpenAIRE

Full Text Finder

18

Academic Journal

Property-Based Testing by Elaborating Proof Outlines

Authors: Miller, Dale, Momigliano, Alberto

Contributors: Miller, Dale, Laboratoire d'informatique de l'École polytechnique Palaiseau (LIX), École polytechnique (X), Institut Polytechnique de Paris (IP Paris)-Institut Polytechnique de Paris (IP Paris)-Centre National de la Recherche Scientifique (CNRS), Automatisation et ReprésenTation: fOndation du calcUl et de la déducTion (PARTOUT), Institut Polytechnique de Paris (IP Paris)-Institut Polytechnique de Paris (IP Paris)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X), Institut Polytechnique de Paris (IP Paris)-Institut Polytechnique de Paris (IP Paris)-Centre National de la Recherche Scientifique (CNRS)-Centre Inria de l'Institut Polytechnique de Paris, Centre Inria de Saclay, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre Inria de Saclay, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Università degli Studi di Milano = University of Milan (UNIMI)

Source: Theory and Practice of Logic Programming. 24:1123-1162

Subject Terms: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, [INFO.INFO-PL]Computer Science [cs]/Programming Languages [cs.PL], [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], λ-tree syntax, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], 0102 computer and information sciences, 02 engineering and technology, relational specifications, [INFO] Computer Science [cs], 01 natural sciences, metatheory of programming languages, [INFO.INFO-PL] Computer Science [cs]/Programming Languages [cs.PL], Logic in Computer Science (cs.LO), linear logic, 0202 electrical engineering, electronic engineering, information engineering, [INFO]Computer Science [cs], property-based testing, meta-theory of programing languages