Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
background theory
Description:
An assumed theoretical framework or set of premises used to formulate, interpret, or simplify reasoning in mathematics and philosophy of science.
Related topics:
Logic, Reasoning, and Knowledge (19%),
Logic, programming, and type systems (11%),
Formal Methods in Verification (10%),
Philosophy of Biology and Scientific Explanation (9%)
OpenAlex ID:
keywords/background-theory
Z3: An Efficient SMT Solver
2008
·
Leonardo de Moura
, Nikolaj Bjørner
·
Lecture notes in computer science
·
10,301
Syntax-guided synthesis
2013
·
Rajeev Alur
, Rastislav Bodik
, et al.
·
Formal Methods in Computer-Aided Design
·
926
PDF
How to Tell When Simpler, More Unified, or LessAd HocTheories will Provide More Accurate Predictions
1994
·
MALCOLM FORSTER
, ELLIOTT SOBER
·
The British Journal for the Philosophy of Science
·
774
Satisfiability Modulo Theories
2009
·
Barrett Clark
, Sebastiani Roberto
, et al.
·
Frontiers in artificial intelligence and applications
·
340
Abductive reasoning and qualitative research
2012
·
Martin Lipscomb
·
Nursing Philosophy
·
255
Syntax-Guided Synthesis
2015
·
Alur Rajeev
, Bodik Rastislav
, et al.
·
NATO science for peace and security series. D, Information and communication security
·
254
SMT-Based Bounded Model Checking for Embedded ANSI-C Software
2011
·
Lucas Cordeiro
, Bernd Fischer
, et al.
·
IEEE Transactions on Software Engineering
·
218
On Solving Universally Quantified Horn Clauses
2013
·
Nikolaj Bjørner
, Ken McMillan
, et al.
·
Lecture notes in computer science
·
147
Chapter 33. Satisfiability Modulo Theories
2021
·
Clark Barrett
, Roberto Sebastiani
, et al.
·
Frontiers in artificial intelligence and applications
·
141
IC3 Modulo Theories via Implicit Predicate Abstraction
2014
·
Alessandro Cimatti
, Alberto Griggio
, et al.
·
Lecture notes in computer science
·
137
SMT-COMP: Satisfiability Modulo Theories Competition
2005
·
Clark Barrett
, Leonardo de Moura
, et al.
·
Lecture notes in computer science
·
131
Automating Inductive Proofs Using Theory Exploration
2013
·
Koen Claessen
, Moa Johansson
, et al.
·
Lecture notes in computer science
·
118
Didactic Objects and Didactic Models in Radical Constructivism
2002
·
Patrick W. Thompson
·
Springer eBooks
·
96
A Formal Theory of Commonsense Psychology: How People Think People Think
2017
·
Andrew S. Gordon
, Jerry R. Hobbs
·
Cambridge University Press eBooks
·
94
From things to thinking: Cognitive archaeology
2019
·
Adrian Currie
, Anton Killin
·
Mind & Language
·
90
Near-IR Spectroscopy and Its Applications
2017
·
Yukihiro Ozaki
, Christian W. Huck
, et al.
·
Elsevier eBooks
·
89
Infinite-state invariant checking with IC3 and predicate abstraction
2016
·
Alessandro Cimatti
, Alberto Griggio
, et al.
·
Formal Methods in System Design
·
69
Inductive Logic Programming as Abductive Search
2010
·
Corapi, Domenico
, Russo, Alessandra
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
67
PDF
Induction from answer sets in nonmonotonic logic programs
2005
·
Chiaki Sakama
·
ACM Transactions on Computational Logic
·
66
Reflections on "Reflective Equilibrium"
2006
·
Zhao Xiang-lu
·
Journal of Hengyang Normal University
·
63
4 Computational modal logic
2007
·
Ian Horrocks
, Ullrich Hustadt
, et al.
·
Studies in logic and practical reasoning
·
62
PDF
Hierarchic Superposition with Weak Abstraction
2013
·
Peter Baumgartner
, Uwe Waldmann
·
Lecture notes in computer science
·
61
Observations, Theories and the Evolution of the Human Spirit
1992
·
Jim Bogen
, Jim Woodward
·
Philosophy of Science
·
58
Relational Reasoning via SMT Solving
2011
·
Aboubakr Achraf El Ghazi
, Mana Taghdiri
·
Lecture notes in computer science
·
55
On Deciding Satisfiability by Theorem Proving with Speculative Inferences
2010
·
Maria Paola Bonacina
, Christopher A. Lynch
, et al.
·
Journal of Automated Reasoning
·
55
Show more works
View as search
Works count:
367
Citation count:
16,650
Year
Topic
Type