Zobrazeno 1 - 10
of 73
pro vyhledávání: '"ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES"'
Autor:
Kohler, Arnaud
Publikováno v:
PFIA JIAF 2022
PFIA JIAF 2022, Jun 2022, Saint-Etienne, France
PFIA JIAF 2022, Jun 2022, Saint-Etienne, France
International audience; It is commonly accepted that propositional logic is insufficient to capture human reasoning. To extend its capabilities, we propose to automatically integrate silent propositions into the set of atomic propositions. We call th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3430::60ee9d0bee19866087909b9d73f2b751
https://hal.archives-ouvertes.fr/hal-02120285
https://hal.archives-ouvertes.fr/hal-02120285
Autor:
Bertolissi, Clara
Publikováno v:
Cryptography and Security [cs.CR]. Aix-Marseile Université, France, 2022
The evolution of classical information systems has introduced new technologies and services forinformation managing and sharing. With the spread of the Internet, it is now possible to easilyshare vast amounts of electronic information and computer re
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::e17b6598364437d08d5df93d3fd7d567
https://hal.science/tel-03921970
https://hal.science/tel-03921970
Publikováno v:
Ellipses, 2020, 9782340042612
National audience; Cet ouvrage débute par une introduction à la logique des prédicats du premier ordre : syntaxe, sémantique et preuves formelles. Il guide ensuite le lecteur vers quelques uns de ses aspects plus avancés : théorème de complét
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::0e60cb4554ffa7c4524730b4fba8d98a
https://hal.archives-ouvertes.fr/hal-02995890
https://hal.archives-ouvertes.fr/hal-02995890
Autor:
Moot, Richard
We present a proof-theoretic analysis of the logic NLλ (Barker & Shan 2014, Barker 2019). We notably introduce a novel calculus of proof nets and prove it is sound and complete with respect to the sequent calculus for the logic. We study decidabilit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::f1beed69619dc7cd11e04b81d02303cf
https://hal-lirmm.ccsd.cnrs.fr/lirmm-02973980/file/nllam.pdf
https://hal-lirmm.ccsd.cnrs.fr/lirmm-02973980/file/nllam.pdf
Autor:
Das, Anupam, Riba, Colin
Logical Methods in Computer Science ; Volume 16, Issue 4 ; 1860-5974
This paper presents a complete axiomatization of Monadic Second-Order Logic (MSO) over infinite trees. MSO on infinite trees is a rich system, and its decidability ("Rabin's Tr
This paper presents a complete axiomatization of Monadic Second-Order Logic (MSO) over infinite trees. MSO on infinite trees is a rich system, and its decidability ("Rabin's Tr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d2b9ca657c2aa17ee5a87883c783ad0e
https://hal.science/hal-02067267v2/file/fsomso.pdf
https://hal.science/hal-02067267v2/file/fsomso.pdf
Autor:
Kohler, Arnaud
The propositional logic Lp is the smallest syntax that formalizes Aristotle's three principles. It is commonly accepted that it is insufficient to capture human reasoning. Many formalisms have been proposed to extend the modeling capabilities of form
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::d762d45b0f88950ed5a356b215d19e58
https://hal.archives-ouvertes.fr/hal-02120285v5/document
https://hal.archives-ouvertes.fr/hal-02120285v5/document
Publikováno v:
International Workshop on Verification and Program Transformation
International Workshop on Verification and Program Transformation, Apr 2020, Dublin, Ireland. pp.110-124, ⟨10.4204/EPTCS.320.8⟩
[Research Report] LORIA UMR 7503 CNRS, INRIA, Université de LORRAINE. 2020, pp.36
VPT/HCVS@ETAPS
International Workshop on Verification and Program Transformation, Apr 2020, Dublin, Ireland. pp.110-124, ⟨10.4204/EPTCS.320.8⟩
[Research Report] LORIA UMR 7503 CNRS, INRIA, Université de LORRAINE. 2020, pp.36
VPT/HCVS@ETAPS
Distributed algorithms offer challenges in checking that they meet their specifications. Verification techniques can be extended to deal with the verification of safety properties of distributed algorithms. In this paper, we present an approach for c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c72933bca1689ce7d9a4fbd4d4d1e91a
https://hal.inria.fr/hal-02997277
https://hal.inria.fr/hal-02997277
Autor:
Kohler, Arnaud
Be c a thought and f the phrase that expresses it. I propose to formalize the relation between these notions by the formula c ⊨ f. Its application to formal languages generates a new formalism: the contextual logic Lc. Against a semantics of belief
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::b6a82450c6c926a6d070778f10531e3e
https://hal.archives-ouvertes.fr/hal-02120285v4/document
https://hal.archives-ouvertes.fr/hal-02120285v4/document
Autor:
Richard Moot
Publikováno v:
Journal of Language Modelling, Vol 6, Iss 2, Pp 287–317-287–317 (2019)
Journal of Language Modelling
Journal of Language Modelling, Institute of Computer Science, Polish Academy of Sciences, Poland, 2019, 6 (2), pp.287-317. ⟨10.15398/jlm.v6i2.231⟩
Journal of Language Modelling
Journal of Language Modelling, Institute of Computer Science, Polish Academy of Sciences, Poland, 2019, 6 (2), pp.287-317. ⟨10.15398/jlm.v6i2.231⟩
International audience; We propose a low-level way of combining distributional and logical ideas into a single formal system. This will be an instantiation of a more general system, adding weights to proof rules. These weights will not measure some s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::72fd77e52b11cb7587aa91b3139f621b
https://jlm.ipipan.waw.pl/index.php/JLM/article/view/231
https://jlm.ipipan.waw.pl/index.php/JLM/article/view/231
Publikováno v:
LOPSTR 2020-30th International Symposium on Logic-Based Program Synthesis and Transformation
LOPSTR 2020-30th International Symposium on Logic-Based Program Synthesis and Transformation, Sep 2020, Bologna, Italy
CIEL 2019-8ème Conférence en IngénieriE du Logiciel
CIEL 2019-8ème Conférence en IngénieriE du Logiciel, Jun 2019, Toulouse, France
Logic-Based Program Synthesis and Transformation ISBN: 9783030684457
LOPSTR
LOPSTR 2020-30th International Symposium on Logic-Based Program Synthesis and Transformation, Sep 2020, Bologna, Italy
CIEL 2019-8ème Conférence en IngénieriE du Logiciel
CIEL 2019-8ème Conférence en IngénieriE du Logiciel, Jun 2019, Toulouse, France
Logic-Based Program Synthesis and Transformation ISBN: 9783030684457
LOPSTR
National audience; Program transformation is a common practice in computer science, and its many applications can have a range of dierent objectives. For example, a program written in an original high level language could be either translated into ma
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::909d085a7f7af237938ecff74e2510c3
https://hal.inria.fr/hal-02186325
https://hal.inria.fr/hal-02186325