First-order satisfiability in Gödel logics: An NP-complete fragment
Work
Year: 2011
Type: article
Source: Theoretical Computer Science
Cites: 20
Cited by: 4
Related to: 10
FWCI: 0.277
Citation percentile (by year/subfield): 56.66
Topic: Advanced Algebra and Logic
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Sustainable Development Goal Peace, justice, and strong institutions
Open Access status: bronze