The following pages link to (Q3789107):
Displaying 50 items.
- Proof systems and transformation games (Q354613) (← links)
- A decomposition method for CNF minimality proofs (Q392185) (← links)
- Boolean functions with a simple certificate for CNF complexity (Q412324) (← links)
- Information-based distance measures and the canonical reflection of view updates (Q429442) (← links)
- Abnormality and randomness (Q432964) (← links)
- Hydras: complexity on general graphs and a subclass of trees (Q507535) (← links)
- Postulates for revising BDI structures (Q625696) (← links)
- Relations between threshold and \(k\)-interval Boolean functions (Q646713) (← links)
- Induction in linear logic (Q674992) (← links)
- A subclass of Horn CNFs optimally compressible in polynomial time (Q693287) (← links)
- Compiling a default reasoning system into Prolog (Q750134) (← links)
- Disjoint essential sets of implicates of a CQ Horn function (Q766268) (← links)
- Filter-based resolution principle for lattice-valued propositional logic LP\((X)\) (Q867665) (← links)
- The logicist manifesto: At long last let logic-based artificial intelligence become a field unto itself (Q959049) (← links)
- Exclusive and essential sets of implicates of Boolean functions (Q968115) (← links)
- Computing finite models by reduction to function-free clause logic (Q1006733) (← links)
- Recognition of interval Boolean functions (Q1029585) (← links)
- A logical framework for default reasoning (Q1104777) (← links)
- A generalization of collapsible cases of circumscription (Q1115424) (← links)
- Talking to Sibilla: An approach to context dependent natural language comprehension (Q1127118) (← links)
- Speeding up inferences using relevance reasoning: a formalism and algorithms (Q1127352) (← links)
- Frames in the space of situations (Q1174513) (← links)
- Finding optimal derivation strategies in redundant knowledge bases (Q1182170) (← links)
- Reasoning about reasoning in a meta-level architecture (Q1183375) (← links)
- Maintaining mental models of agents who have existential misconceptions (Q1187220) (← links)
- Bayesian diagnosis in expert systems (Q1193471) (← links)
- Truth maintenance systems and their application for verifying expert system knowledge bases (Q1193853) (← links)
- Semantic networks (Q1202620) (← links)
- Multiple perspective dynamic decision making (Q1274561) (← links)
- From environments to representations -- a mathematical theory of artificial perceptions (Q1274888) (← links)
- New methods for computing inferences in first order logic (Q1309900) (← links)
- User modeling for flexible inference control and its relevance to decision-making in economics and management (Q1316421) (← links)
- Axiomatization and completeness of uncountably valued approximation logic (Q1317906) (← links)
- A resolution principle for constrained logics (Q1327159) (← links)
- Problem solving by searching for models with a theorem prover (Q1337680) (← links)
- Towards efficient induction mechanisms in database systems (Q1341712) (← links)
- Resolution and the integrality of satisfiability problems (Q1352293) (← links)
- Static and dynamic aspects of goal-oriented concurrency control (Q1353964) (← links)
- Generalized resolution for 0--1 linear inequalities (Q1354004) (← links)
- Belief revision in a microworld (Q1354066) (← links)
- Branch-and-cut solution of inference problems in propositional logic (Q1356213) (← links)
- On Skolemization in constrained logics (Q1380406) (← links)
- Logical settings for concept-learning (Q1389603) (← links)
- Permissive planning: Extending classical planning to uncertain task domains. (Q1399128) (← links)
- Uncertain logic processing: logic-based inference and reasoning using Dempster-Shafer models (Q1642751) (← links)
- Automated merging of conflicting knowledge bases, using a consistent, majority-rule approach with knowledge-form maintenance (Q1777157) (← links)
- A resolution-based system for symbolic approximate reasoning (Q1809351) (← links)
- Logic of agreement: Foundations, semantic system and proof theory (Q1818006) (← links)
- On the complexity of data disjunctions. (Q1853503) (← links)
- On the Hamming distance of constraint satisfaction problems. (Q1853512) (← links)
