スコーレム標準形
1. Skolem normal formReduction to Skolem normal form is a method for removing existential quantifiers from formal logic statements, often performed as the first step in an automated theorem prover. A formula of first-order logic is in Skolem normal form if it is in conjunctive prenex normal form with only universal first-order quantifiers. Every first-order formula can be converted into Skolem normal form while not changing its satisfiability via a process called Skolemization (sometimes spelled "Skolemnization").
Read “Skolem normal form” on English Wikipedia
Read “スコーレム標準形” on Japanese Wikipedia
Read “Skolem normal form” on DBpedia
Read “Skolem normal form” on English Wikipedia
Read “スコーレム標準形” on Japanese Wikipedia
Read “Skolem normal form” on DBpedia
Discussions
Log in to talk about this word.