An interactive semantics of logic programming
From MaRDI portal
(Redirected from Publication:4452646)
Recommendations
Cited in
(20)- Category theoretic semantics for theorem proving in logic programming: embracing the laxness
- Logic programming: laxness and saturation
- Translation of interactive Datalog programs for microcontrollers to finite state machines
- Interactive Logical Structures
- scientific article; zbMATH DE number 1696783 (Why is no real title available?)
- A connector algebra for P/T nets interactions
- A semantic framework for open processes
- Reactive systems, (semi-)saturated semantics and coalgebras on presheaves
- GETGRATS: a summary of scientific results (with annotated bibliography)
- On the semantics of deliberation in IndiGolog -- from theory to implementation
- Comparing higher-order encodings in logical frameworks and tile logic
- Tiling transactions in rewriting logic
- Models of Computation: A Tribute to Ugo Montanari’s Vision
- Observational congruences for dynamically reconfigurable tile systems
- Coalgebraic semantics for parallel derivation strategies in logic programming
- Exploiting parallelism in coalgebraic logic programming
- S-semantics for logic programming: a retrospective look
- Comparing cospan-spans and tiles via a Hoare-style process calculus
- Programming by predicates: a formal model for interactive synthesis
- Rewriting logic: Roadmap and bibliography
This page was built for publication: An interactive semantics of logic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4452646)
