Pages that link to "Item:Q1075318"
From MaRDI portal
The following pages link to Complete problems in the first-order predicate calculus (Q1075318):
Displaying 10 items.
- A Datalog hammer for supervisor verification conditions modulo simple linear arithmetic (Q831915) (← links)
- Equational methods in first order predicate calculus (Q1065783) (← links)
- Isomorphisms and 1-L reductions (Q1107310) (← links)
- Complexity results for classes of quantificational formulas (Q1157324) (← links)
- Inference flexibility in Horn clause knowledge bases and the simplex method (Q1319393) (← links)
- Problem solving by searching for models with a theorem prover (Q1337680) (← links)
- SCL clause learning from simple models (Q2305416) (← links)
- Sufficient-completeness, ground-reducibility and their complexity (Q2641108) (← links)
- Meeting of the Association for Symbolic Logic, Stanford, California, 1985 (Q3755421) (← links)
- Classifying the computational complexity of problems (Q3781088) (← links)