Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 217,275,345 papers from all fields of science
Search
Sign In
Create Free Account
Atomic formula
Known as:
Atom (disambiguation)
, Atom (logic)
, Atomic
In mathematical logic, an atomic formula (also known simply as an atom) is a formula with no deeper propositional structure, that is, a formula that…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
40 relations
Atomic sentence
CTL*
Computation tree logic
Conjunctive query
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2016
Highly Cited
2016
Jointly Embedding Knowledge Graphs and Logical Rules
Shu Guo
,
Quan Wang
,
Lihong Wang
,
Bin Wang
,
Li Guo
Conference on Empirical Methods in Natural…
2016
Corpus ID: 7958862
,
Highly Cited
2008
Highly Cited
2008
Principles of model checking
C. Baier
,
J. Katoen
2008
Corpus ID: 5302889
Our growing dependence on increasingly complex computer and software systems necessitates the development of formalisms…
Expand
Highly Cited
2005
Highly Cited
2005
Computer-aided molecular design using Tabu search
B. Lin
,
Sunitha Chavali
,
K. Camarda
,
David C. Miller
Computers and Chemical Engineering
2005
Corpus ID: 9757396
Highly Cited
2004
Highly Cited
2004
A Propositional Logic-Based Method for Verification of Feature Models
Wei Zhang
,
Haiyan Zhao
,
Hong Mei
IEEE International Conference on Formal…
2004
Corpus ID: 14517163
The feature model is a domain/product-line oriented requirements model based on hierarchical structure and explicit variability…
Expand
Highly Cited
2000
Highly Cited
2000
Specification and proof in membership equational logic
A. Bouhoula
,
J. Jouannaud
,
J. Meseguer
Theoretical Computer Science
2000
Corpus ID: 6971641
Highly Cited
1993
Highly Cited
1993
Applying Linear Quantifier Elimination
R. Loos
,
V. Weispfenning
Computer/law journal
1993
Corpus ID: 12745182
The linear quantifier elimination algorithm for ordered fields in [15] is applicable to a wide range of examplee involving even…
Expand
Highly Cited
1993
Highly Cited
1993
First order abduction via tableau and sequent calculi
M. C. Mayer
,
F. Pirri
Logic Journal of the IGPL
1993
Corpus ID: 16298027
The formalization of abductive reasoning is still an open question: there is no general agreement on the boundary of some basic…
Expand
Highly Cited
1991
Highly Cited
1991
A Correspondence Theory for Terminological Logics: Preliminary Report
K. Schild
International Joint Conference on Artificial…
1991
Corpus ID: 1076693
We show that the terminological logic ACC comprising Boolean operations on concepts and value restrictions is a notational…
Expand
Highly Cited
1981
Highly Cited
1981
On Databases with Incomplete Information
W. Lipski
JACM
1981
Corpus ID: 18878482
Semantic and logical problems arising in an incomplete information database are investigated. A simple query language is…
Expand
Highly Cited
1963
Highly Cited
1963
Semantical Analysis of Modal Logic I Normal Modal Propositional Calculi
Saul A. Kripke
1963
Corpus ID: 18604212
Publisher Summary This chapter discusses semantical analysis of modal logic ii and non-normal modal propositional calculi. The…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE