Product
Help
Pricing
About
Jobs
Log in
Get started
Work
Add to collection
Two Easy Theories Whose Combination is Hard
HTML
Details
Locations
Year:
2002
Type:
article
Author:
Vaughan Pratt
Language:
English
Topic:
Logic, programming, and type systems
Subfield:
Software
Field:
Computer Science
Domain:
Physical Sciences
Keywords:
satisfiability,
validity,
uninterpreted functions,
NP-completeness,
polynomial-time decidability,
arrays,
successors,
decision procedures,
theory combination
show all 9
Open Access status:
closed
OpenAlex ID:
W205961229
FWCI:
16.4
Cites:
3
Cited by:
89
Related to:
10