Principles and Practice of Declarative Programming
E1093131
UNEXPLORED
Principles and Practice of Declarative Programming is an international academic conference focused on research and advances in declarative programming languages and paradigms.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Principles and Practice of Declarative Programming canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T14341559 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Principles and Practice of Declarative Programming Context triple: [PPDP, fullName, Principles and Practice of Declarative Programming]
-
A.
Practical Aspects of Declarative Languages
Practical Aspects of Declarative Languages is an academic conference focused on the practical implementation, application, and evaluation of declarative programming languages and related technologies.
-
B.
DataBase systems and Logic Programming
DataBase systems and Logic Programming (DBLP) is a computer science bibliography project that indexes research publications in areas such as databases, logic programming, and related fields.
-
C.
Kripke–Kleene semantics in logic programming
Kripke–Kleene semantics in logic programming is a three-valued, fixed-point-based approach to interpreting logic programs that captures partial or undefined information without committing to classical true/false evaluations.
-
D.
The Logic of Computer Programming
The Logic of Computer Programming is a foundational textbook in theoretical computer science that rigorously develops methods for specifying, proving, and reasoning about the correctness of computer programs.
-
E.
Dijkstra weakest precondition calculus
Dijkstra weakest precondition calculus is a formal method for reasoning about program correctness by computing the weakest conditions that must hold before execution to guarantee a desired postcondition.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Principles and Practice of Declarative Programming Target entity description: Principles and Practice of Declarative Programming is an international academic conference focused on research and advances in declarative programming languages and paradigms.
-
A.
Practical Aspects of Declarative Languages
Practical Aspects of Declarative Languages is an academic conference focused on the practical implementation, application, and evaluation of declarative programming languages and related technologies.
-
B.
DataBase systems and Logic Programming
DataBase systems and Logic Programming (DBLP) is a computer science bibliography project that indexes research publications in areas such as databases, logic programming, and related fields.
-
C.
Kripke–Kleene semantics in logic programming
Kripke–Kleene semantics in logic programming is a three-valued, fixed-point-based approach to interpreting logic programs that captures partial or undefined information without committing to classical true/false evaluations.
-
D.
The Logic of Computer Programming
The Logic of Computer Programming is a foundational textbook in theoretical computer science that rigorously develops methods for specifying, proving, and reasoning about the correctness of computer programs.
-
E.
Dijkstra weakest precondition calculus
Dijkstra weakest precondition calculus is a formal method for reasoning about program correctness by computing the weakest conditions that must hold before execution to guarantee a desired postcondition.
- F. None of above. chosen
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.