The following pages link to (Q4846259):
Displaying 16 items.
- Computing minimal models by partial instantiation (Q672131) (← links)
- A relevance restriction strategy for automated deduction (Q814429) (← links)
- Resolution is cut-free (Q972424) (← links)
- Theorem proving by chain resolution (Q1274972) (← links)
- Computing definite logic programs by partial instantiation (Q1326778) (← links)
- Intuitionistic logic as the implement of incremental model construction for natural language (Q1383466) (← links)
- The co-invariant generator: An aid in deriving loop bodies (Q1911318) (← links)
- The expressiveness of locally stratified programs (Q1924734) (← links)
- First-order automated reasoning with theories: when deduction modulo theory meets practice (Q2209546) (← links)
- (Q3125203) (← links)
- A Logical Splitting Strategy for the Belief Structure of Agents (Q3647209) (← links)
- (Q3766839) (← links)
- Modelling a public-key infrastructure (Q5096419) (← links)
- Game characterizations of logic program properties (Q5101444) (← links)
- Index Sets for Finite Normal Predicate Logic Programs with Function Symbols (Q5283418) (← links)
- An Application of Logic Engineering (Q5463271) (← links)
