The following pages link to (Q4215638):
Displaying 17 items.
- A logic programming framework for possibilistic argumentation: Formalization and logical properties (Q835125) (← links)
- A logical calculus for problem solving in highly structured application domains (Q1115646) (← links)
- Mints type deductive calculi for logic programming (Q1192340) (← links)
- First-order theories for pure Prolog programs with negation (Q1892097) (← links)
- (Q2999186) (← links)
- Restricting Initial Sequents: The Trade-Offs Between Identity, Contraction and Cut (Q3305560) (← links)
- A Schemata Calculus for Propositional Logic (Q3648719) (← links)
- (Q3804241) (← links)
- (Q4012879) (← links)
- The IFF proof procedure for abductive logic programming (Q4371992) (← links)
- (Q4440568) (← links)
- (Q4817211) (← links)
- Proof-theoretic notions for software maintenance (Q4923374) (← links)
- (Q4944869) (← links)
- (Q4955346) (← links)
- A transformation of propositional Prolog programs into classical logic (Q5101458) (← links)
- Beluga: A Framework for Programming and Reasoning with Deductive Systems (System Description) (Q5747747) (← links)