-
Sébastien Ferré.
Complete and Incomplete Knowledge in Logical Information Systems.
In Salem Benferhat and Philippe Besnard, editors,
Symbolic and Quantitative Approaches to Reasoning with Uncertainty,
LNCS 2143,
pages 782-791,
2001.
Springer.
Keyword(s): modal logic,
All I know,
complete and incomplete knowledge,
information system.
Abstract: |
We present a generalization of logic All I Know by presenting it as an extension of standard modal logics. We study how this logic can be used to represent complete and incomplete knowledge in Logical Information Systems. In these information systems, a knowledge base is a collection of objects (e.g., files, bibliographical items) described in the same logic as used for expressing queries. We show that usual All I Know (transitive and euclidean accessibility relation) is convenient for representing complete knowledge, but not for incomplete knowledge. For this, we use \emph{serial} All I Know (serial accessibility relation). |
@InProceedings{Fer2001,
author = {Sébastien Ferré},
title = {Complete and Incomplete Knowledge in Logical Information Systems},
booktitle = {Symbolic and Quantitative Approaches to Reasoning with Uncertainty},
pages = "782--791",
year = "2001",
editor = "Salem Benferhat and Philippe Besnard",
series = "LNCS 2143",
publisher = "Springer",
keywords = {modal logic, All I know, complete and incomplete knowledge, information system},
langue = "anglais",
abstract = "We present a generalization of logic All I Know by presenting it as an extension of standard modal logics. We study how this logic can be used to represent complete and incomplete knowledge in Logical Information Systems. In these information systems, a knowledge base is a collection of objects (e.g., files, bibliographical items) described in the same logic as used for expressing queries. We show that usual All I Know (transitive and euclidean accessibility relation) is convenient for representing complete knowledge, but not for incomplete knowledge. For this, we use \emph{serial} All I Know (serial accessibility relation).",
}
-
Sébastien Ferré and Olivier Ridoux.
A Framework for Developing Embeddable Customized Logics.
In A. Pettorossi, editor,
Int. Work. Logic-based Program Synthesis and Transformation,
LNCS 2372,
pages 191-215,
2001.
Springer.
[WWW]
Keyword(s): logic,
composition,
theorem prover,
logic-based systems.
Abstract: |
Logic-based applications often use customized logics which are composed of several logics. These customized logics are also often embedded as a black-box in an application. Their implementation requires the specification of a well-defined interface with common operations such as a parser, a printer, and a theorem prover. In order to be able to compose these logics, one must also define composition laws, and prove their properties. We present the principles of logic functors and their compositions for constructing customized logics. An important issue is how the operations of different sublogics inter-operate. We propose a formalization of the logic functors, their semantics, implementations, and their composition. |
@inproceedings{FerRid2001b,
author = {Sébastien Ferré and Olivier Ridoux},
title = {A Framework for Developing Embeddable Customized Logics},
booktitle = {Int. Work. Logic-based Program Synthesis and Transformation},
year = {2001},
editor = {A. Pettorossi},
series = {LNCS 2372},
publisher = {Springer},
pages = {191--215},
langue = {anglais},
url = {ftp://ftp.irisa.fr/local/lande/sf-or-lopstr01.ps.gz},
keywords = {logic, composition, theorem prover, logic-based systems},
abstract = {Logic-based applications often use customized logics which are composed of several logics. These customized logics are also often embedded as a black-box in an application. Their implementation requires the specification of a well-defined interface with common operations such as a parser, a printer, and a theorem prover. In order to be able to compose these logics, one must also define composition laws, and prove their properties. We present the principles of logic functors and their compositions for constructing customized logics. An important issue is how the operations of different sublogics inter-operate. We propose a formalization of the logic functors, their semantics, implementations, and their composition.},
}
-
Sébastien Ferré and Olivier Ridoux.
Searching for Objects and Properties with Logical Concept Analysis.
In Harry S. Delugach and Gerd Stumme, editors,
International Conference on Conceptual Structures,
LNCS 2120,
pages 187-201,
2001.
Springer.
Keyword(s): concept analysis,
navigation,
knowledge discovery,
logical information system.
Abstract: |
Logical Concept Analysis is Formal Concept Analysis where logical formulas replace sets of attributes. We define a Logical Information System that combines navigation and querying for searching for objects. Places and queries are unified as formal concepts represented by logical formulas. Answers can be both extensional (objects belonging to a concept) and intensional (formulas refining a concept). Thus, all facets of navigation are formalized in terms of Logical Concept Analysis. We show that the definition of being a refinement of some concept is a specific case of Knowledge Discovery in a formal context. It can be generalized to recover more classical KD~operations like machine-learning through the computation of necessary or sufficient properties (modulo some confidence), or data-mining through association rules. |
@InProceedings{FerRid2001,
author = {Sébastien Ferré and Olivier Ridoux},
title = {Searching for Objects and Properties with Logical Concept Analysis},
booktitle = {International Conference on Conceptual Structures},
pages = "187--201",
year = {2001},
editor = "Harry S. Delugach and Gerd Stumme",
series = "LNCS 2120",
publisher = "Springer",
keywords = {concept analysis, navigation, knowledge discovery, logical information system},
langue = "anglais",
abstract = "Logical Concept Analysis is Formal Concept Analysis where logical formulas replace sets of attributes. We define a Logical Information System that combines navigation and querying for searching for objects. Places and queries are unified as formal concepts represented by logical formulas. Answers can be both extensional (objects belonging to a concept) and intensional (formulas refining a concept). Thus, all facets of navigation are formalized in terms of Logical Concept Analysis. We show that the definition of being a refinement of some concept is a specific case of Knowledge Discovery in a formal context. It can be generalized to recover more classical KD~operations like machine-learning through the computation of necessary or sufficient properties (modulo some confidence), or data-mining through association rules.",
}