Pages that link to "Item:Q4730755"
From MaRDI portal
The following pages link to A computable semantics for general logic programs (Q4730755):
Displaying 13 items.
- Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs (Q622117) (← links)
- A sound and complete semantics for a similarity-based logic programming language (Q723251) (← links)
- Protected completions of first-order general logic programs (Q911800) (← links)
- On abstract resource semantics and computability logic (Q980944) (← links)
- Definite clause programs are canonical (over a suitable domain) (Q1356204) (← links)
- Logic programs as compact denotations. (Q1426046) (← links)
- On computability by logic programs (Q1924787) (← links)
- A semantic approach to illative combinatory logic (Q2915681) (← links)
- (Q4211444) (← links)
- Reducts of Propositional Theories, Satisfiability Relations, and Generalizations of Semantics of Logic Programs (Q4649731) (← links)
- (Q4715441) (← links)
- (Q4817211) (← links)
- Computer Science Logic (Q5292665) (← links)