Skip to search formSkip to main contentSkip to account menu

Intensional logic

Known as: Intensional 
Intensional logic is an approach to predicate logic that extends first-order logic, which has quantifiers that range over the individuals of a… 
Wikipedia (opens in a new tab)

Related topics

Related topics

18 relations
De Morgan's lawsDynamic logic (modal logic)Extension (semantics)First-order logic

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
Managing uncertainty in bidirectional model transformations
In Model-Driven Engineering bidirectionality in transformations is regarded as a key mechanism. Recent approaches to non… 
Review
2010
Review
2010
BIOLOGICAL TAXONOMY AND ONTOLOGY DEVELOPMENT: SCOPE AND LIMITATIONS
The prospects of integrating full-blown biological taxonomies into an ontological reasoning framework are critically reviewed… 
2008
2008
Natural Language and Information Systems, 13th International Conference on Applications of Natural Language to Information Systems, NLDB 2008, London, UK, June 24-27, 2008, Proceedings
2005
2005
Intensional Logic and Epistemic Independency of Intelligent Database Agents
In the typical Web applications each intelligent database agent can be defined as a Knowledge system (KS) with a global ontology… 
Highly Cited
2002
Highly Cited
2002
Global Schema Generation Using Formal Ontologies
This paper deals with the problem of handling semantic heterogeneity during schema integration. Semantics refer to the meaning of… 
2000
2000
Completeness of Information Sources
Information quality plays a crucial role in every application that integrates data from autonomous sources. However, information… 
1993
1993
Semantic Query Optimization in Deductive Object-Oriented Databases
This paper addresses the problem of semantic query reformulation in the context of object-oriented deductive databases. It… 
Highly Cited
1991
Highly Cited
1991
Medical expert systems based on causal probabilistic networks
1989
1989
Boundedness is Undecidable for Datalog Programs with a Single Recursive Rule
1982
1982
Intensional logic in extensional language
Frege's conception of reference has been interpreted as calling for a completely extensional language, on the grounds that… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)