Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Satisfiability Modulo Theories
View through CrossRef
Applications in artificial intelligence, formal verification, and other areas have greatly benefited from the recent advances in SAT. It is often the case, however, that applications in these fields require determining the satisfiability of formulas in more expressive logics such as first-order logic. Also, these applications typically require not general first-order satisfiability, but rather satisfiability with respect to some background theory, which fixes the interpretations of certain predicate and function symbols.
Title: Satisfiability Modulo Theories
Description:
Applications in artificial intelligence, formal verification, and other areas have greatly benefited from the recent advances in SAT.
It is often the case, however, that applications in these fields require determining the satisfiability of formulas in more expressive logics such as first-order logic.
Also, these applications typically require not general first-order satisfiability, but rather satisfiability with respect to some background theory, which fixes the interpretations of certain predicate and function symbols.
Related Results
A History of Satisfiability
A History of Satisfiability
This chapter traces the links between the notion of Satisfiability and the attempts by mathematicians, philosophers, engineers, and scientists over the last 2300 years to develop e...
Satisfiability in composition-nominative logics
Satisfiability in composition-nominative logics
Abstract
Composition-nominative logics are algebra-based logics of partial predicates constructed in a semantic-syntactic style on the methodological basis, which is...
Infinite families of congruences modulo $2$ for $(\ell, k)$-regular partitions
Infinite families of congruences modulo $2$ for $(\ell, k)$-regular partitions
Let $b_{\ell, k}(n)$ denote the number of $(\ell, k)$-regular partition of $n$. Recently, some congruences modulo $2$ for $ (3, 8), (4, 7)$-regular partition and modulo $8$, modul...
Bounded Satisfiability Checking of FOL * Formulas with Aggregations
Bounded Satisfiability Checking of FOL * Formulas with Aggregations
Abstract
Software systems handling data are increasingly required to comply with legal properties (LPs) aimed at ensuring security and data privacy. Automated reasoning of ...
Energy Based Logic Mining Analysis with Hopfield Neural Network for Recruitment Evaluation
Energy Based Logic Mining Analysis with Hopfield Neural Network for Recruitment Evaluation
An effective recruitment evaluation plays an important role in the success of companies, industries and institutions. In order to obtain insight on the relationship between factors...
Burden of the Beast
Burden of the Beast
Introduction
Throughout the COVID-19 pandemic, and its fluctuating waves of infections and the emergence of new variants, Indigenous populations in Australia and worldwide have re...
#101 Propriedades mecânicas de resinas impressas para prótese fixa após envelhecimento
#101 Propriedades mecânicas de resinas impressas para prótese fixa após envelhecimento
Objetivos: Avaliar a influência do tipo de material e do modo de envelhecimento na resistência à flexão e módulo de flexão de resinas à base de metacrilato, convencionais e impress...
UMA PROPOSTA DE WORKFLOW PARA CONSTRUÇÃO DE CORPUS DIGITAL EM LÍNGUA DE SINAIS
UMA PROPOSTA DE WORKFLOW PARA CONSTRUÇÃO DE CORPUS DIGITAL EM LÍNGUA DE SINAIS
Os corpora de línguas de sinais disponíveis atualmente em pesquisas linguísticas e em sites para acesso livre são constituídos por um módulo de gravação feita em vídeo, pois os dad...