There is no Fully Abstract Fixpoint Semantics for Non-Deterministic Languages with Infinite Computations.
Sven-Olof NyströmPublished in: Inf. Process. Lett. (1996)
Keyphrases
- fixpoint semantics
- logic programs
- deductive databases
- fixpoint
- model theoretic
- datalog programs
- data complexity
- expressive power
- closed world assumption
- logic programming
- declarative semantics
- query answering
- stable models
- high level
- description logics
- inference rules
- satisfiability problem
- incomplete information
- operational semantics
- constraint satisfaction
- natural language
- databases