# Logic, Reasoning, and Knowledge

**Type:** Topics  
**Canonical URL:** https://scholariq.org/topics/logic-reasoning-and-knowledge/

## Facts

| Field | Value |
| --- | --- |
| Description | This cluster of papers focuses on the intersection of logic programming, knowledge representation, and reasoning. It encompasses topics such as answer set programming, modal logic, belief revision, temporal logic, epistemic logic, nonmonotonic reasoning, description logics, model checking, and constraint logic programming. |
| Domain | Physical Sciences |
| Field | Computer Science |
| OpenAlex ID | t11010 |
| Works | 14 |

## Topic papers all

- [Agent Programming in 3APL](https://scholariq.org/papers/agent-programming-in-3apl/)
- [Answering queries from context-sensitive probabilistic knowledge bases](https://scholariq.org/papers/answering-queries-from-context-sensitive-probabilistic-knowledge-bases/)
- [Agent Programming with Declarative Goals](https://scholariq.org/papers/agent-programming-with-declarative-goals/)
- [A simple applicative language: mini-ML](https://scholariq.org/papers/a-simple-applicative-language-mini-ml/)
- [Vagueness, Logic and Use: Four Experimental Studies on Vagueness](https://scholariq.org/papers/vagueness-logic-and-use-four-experimental-studies-on-vagueness/)
- [Anytime deduction for probabilistic logic](https://scholariq.org/papers/anytime-deduction-for-probabilistic-logic/)
- [Utility Models for Goal‐Directed, Decision‐Theoretic Planners](https://scholariq.org/papers/utility-models-for-goal-directed-decision-theoretic-planners/)
- [Generating Bayesian Networks from Probability Logic Knowledge Bases](https://scholariq.org/papers/generating-bayesian-networks-from-probability-logic-knowledge-bases/)
- [A fully abstract model for concurrent constraint programming](https://scholariq.org/papers/a-fully-abstract-model-for-concurrent-constraint-programming/)
- [Fuzzy database language and library-fuzzy extension to SQL](https://scholariq.org/papers/fuzzy-database-language-and-library-fuzzy-extension-to-sql/)
- [The minimal non-<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mo stretchy="false">(</mml:mo><mml:mo>⩽</mml:mo><mml:mi>k</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math>-reconstructible relations](https://scholariq.org/papers/the-minimal-non-mml-math-xmlns-mml-http-www-w3-org-1998-math-mathml-altimg-si1/)
- [Modelling supra-classical logic in a Boltzmann neural network: I representation](https://scholariq.org/papers/modelling-supra-classical-logic-in-a-boltzmann-neural-network-i-representation/)
- [Contact-State Transition Graph for Graspless Manipulation Planning.](https://scholariq.org/papers/contact-state-transition-graph-for-graspless-manipulation-planning/)
- [The Boltzmann Machine: a Connectionist Model for Supra-Classical Logic](https://scholariq.org/papers/the-boltzmann-machine-a-connectionist-model-for-supra-classical-logic/)

## Topic primary papers

- [Anytime deduction for probabilistic logic](https://scholariq.org/papers/anytime-deduction-for-probabilistic-logic/)
- [Modelling supra-classical logic in a Boltzmann neural network: I representation](https://scholariq.org/papers/modelling-supra-classical-logic-in-a-boltzmann-neural-network-i-representation/)

---
Source: ScholarIQ — public research metadata, principally OpenAlex. See https://scholariq.org/sources/ for provenance and https://scholariq.org/methodology/ for what these figures mean.