The following pages link to (Q3862380):
Displaying 50 items.
- The eco-cognitive model of abduction. II. Irrelevance and implausibility exculpated (Q266877) (← links)
- A logic-based calculus of events (Q514239) (← links)
- A deductive solution for plan generation (Q578927) (← links)
- An experimental logic based on the fundamental deduction principle (Q580998) (← links)
- A logical framework for depiction and image interpretation (Q582146) (← links)
- Algorithms for generating arguments and counterarguments in propositional logic (Q648354) (← links)
- The alternating fixpoint of logic programs with negation (Q686646) (← links)
- A result on the computational complexity of heuristic estimates for the \(A^*\) algorithm (Q761039) (← links)
- Closures and fairness in the semantics of programming logic (Q799098) (← links)
- Operators vs. arguments: The ins and outs of reification (Q857666) (← links)
- Defining answer classes using resolution refutation (Q881832) (← links)
- The eco-cognitive model of abduction. Ἀπαγωγή now: naturalizing the logic of abduction (Q898777) (← links)
- Issues in the design of a parallel object-oriented language (Q909434) (← links)
- Logic programming with sets (Q909435) (← links)
- Compact normal forms in propositional logic and integer programming formulations (Q910335) (← links)
- Dynamic maintenance of directed hypergraphs (Q913481) (← links)
- Transforming generate-and-test programs to execute under committed-choice AND-parallelism (Q914360) (← links)
- Hypothetical datalog: Complexity and expressibility (Q915436) (← links)
- A new deductive approach to planning (Q922685) (← links)
- Hilbert's epsilon as an operator of indefinite committed choice (Q946570) (← links)
- Preference-based belief revision for rule-based agents (Q1024129) (← links)
- Pronouns and quantifier-scope in English (Q1055756) (← links)
- A new combination of input and unit deductions for Horn sentences (Q1057665) (← links)
- On the correspondence between two classes of reduction systems (Q1059392) (← links)
- Ordering conjunctive queries (Q1060862) (← links)
- Optimal fixedpoints of logic programs (Q1069694) (← links)
- Automated inferencing (Q1070835) (← links)
- A view of programming languages as symbiosis of meaning and computations (Q1079942) (← links)
- Control and data driven execution of logic programs: A comparison (Q1083186) (← links)
- Communication in concurrent dynamic logic (Q1095653) (← links)
- Fuzzy sets and toposes - towards higher order fuzzy logic (Q1097257) (← links)
- Evidential support logic programming (Q1099968) (← links)
- Inconsistency check of a set of clauses using Petri net reductions (Q1100906) (← links)
- Some results and experiments in programming techniques for propositional logic (Q1100931) (← links)
- A fixpoint semantics of Horn sentences based on substitution sets (Q1100934) (← links)
- On finding optimal and near-optimal lineal spanning trees (Q1105381) (← links)
- A new reduction rule for the connection graph proof procedure (Q1114445) (← links)
- Unification theory (Q1124375) (← links)
- A logic for default reasoning (Q1140434) (← links)
- Yet another efficient backward execution algorithm in the AND/OR process model (Q1183471) (← links)
- A methodology for detecting shared variable dependencies in logic programs (Q1186710) (← links)
- Reduction rules for resolution-based systems (Q1187214) (← links)
- Compositional operational semantics for Prolog programs (Q1188120) (← links)
- Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations (Q1196302) (← links)
- A new subsumption method in the connection graph proof procedure (Q1199542) (← links)
- An execution mechanism for nondeterministic, state-oriented programs based on a chart parser (Q1209991) (← links)
- Knowledge and reasoning in program synthesis (Q1216171) (← links)
- A logico-algebraic approach to the model theory of knowledge (Q1263299) (← links)
- Let's plan it deductively! (Q1274761) (← links)
- A heuristic in rules-based systems (Q1310950) (← links)
