Message-based semantica for sat problems

This paper outlines the logical system of MSSG-logic originally developed by the author to represent a particular theory in analytic philosophy of language. That was a theory by philosopher Paul Grice that proposed to consider the intention of the speaker as an important context for the definition of the true meaning of his speech act. MSSG-logic proposes to use special sets of symbols for the additional interpretation of the logical formulas as well as the supersets of these sets ("trees of messages") with defined algebras on them for more complex cases. This particular paper proposes to modify the "linguistic" MSSG-logic to represent the famous computer science boolean satisfiability problems (SAT) with the similar tools. The consequences for computer science and philosophy of language are also discussed

Authors

Publication Details

Journal
Philosophy Economics and Law Review
Published
2024-09-04
DOI
https://doi.org/10.63341/2786-491x-2024-1-67-74
Primary Topic
Semantic Web and Ontologies
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Message-based semantica for sat problems

Iaroslav Petik
Philosophy Economics and Law Review
Semantic Web and Ontologies
article

Message-based semantica for sat problems

Iaroslav Petik
article en

Abstract

This paper outlines the logical system of MSSG-logic originally developed by the author to represent a particular theory in analytic philosophy of language. That was a theory by philosopher Paul Grice that proposed to consider the intention of the speaker as an important context for the definition of the true meaning of his speech act. MSSG-logic proposes to use special sets of symbols for the additional interpretation of the logical formulas as well as the supersets of these sets ("trees of messages") with defined algebras on them for more complex cases. This particular paper proposes to modify the "linguistic" MSSG-logic to represent the famous computer science boolean satisfiability problems (SAT) with the similar tools. The consequences for computer science and philosophy of language are also discussed

Philosophy Economics and Law Review
Openalex Percentile: Top 71%
Semantic Web and Ontologies
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.