Pages that link to "Item:Q4713088"
From MaRDI portal
The following pages link to A transformational approach to negation in logic programming (Q4713088):
Displaying 16 items.
- A necessary condition for constructive negation in constraint logic programming (Q294756) (← links)
- Implementing constructive intensional negation (Q839831) (← links)
- Transforming normal logic programs to constraint logic programs (Q1200979) (← links)
- Equivalence-preserving first-order unfold/fold transformation systems (Q1200980) (← links)
- Probabilistic Horn abduction and Bayesian networks (Q1313950) (← links)
- Sound and complete partial deduction with unfolding based on well-founded measures (Q1314419) (← links)
- Implementing specifications by dynamic inheritance (Q1326576) (← links)
- What is failure? An approach to constructive negation (Q1346220) (← links)
- Model building with ordered resolution: Extracting models from saturated clause sets (Q1404975) (← links)
- Synthesis of positive logic programs for checking a class of definitions with infinite quantification (Q2629858) (← links)
- Automated reasoning with restricted intensional sets (Q2666960) (← links)
- αCheck: A mechanized metatheory model checker (Q4593089) (← links)
- Extending Constructive Logic Negation with Types (Q4982631) (← links)
- Eliminating negation from normal logic programs (Q5096198) (← links)
- An operator for composing deductive data bases with theories of constraints (Q5101441) (← links)
- Constructive negation and constraint logic programming with sets (Q5945160) (← links)
