2023
DOI: 10.1007/s10601-023-09365-0
|View full text |Cite
|
Sign up to set email alerts
|

Reasoning and inference for (Maximum) satisfiability: new insights

Mohamed Sami Cherif

Abstract: At the heart of computer science and artificial intelligence, logic is often used as a powerful language to model and solve complex problems that arise in academia and in real-world applications. A well-known formalism in this context is the Satisfiability (SAT) problem which simply checks whether a given propositional formula in the form of a set of constraints, called clauses, can be satisfied. A natural optimization extension of this problem is Maximum Satisfiability (Max-SAT) which consists in determining … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 212 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?