Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
An implementation of standard ML modules
LFP '88 Proceedings of the 1988 ACM conference on LISP and functional programming
All I know: a study in autoepistemic logic
Artificial Intelligence
The craft of Prolog
A framework for defining logics
Journal of the ACM (JACM)
Institutions: abstract model theory for specification and programming
Journal of the ACM (JACM)
Reasoning in description logics
Principles of knowledge representation
Two classes of Boolean functions for dependency analysis
Science of Computer Programming
Sharing and groundness dependencies in logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
Information Retrieval: Uncertainty and Logics: Advanced Models for the Representation and Retrieval of Information
Introduction to Modern Information Retrieval
Introduction to Modern Information Retrieval
A Logical Generalization of Formal Concept Analysis
ICCS '00 Proceedings of the Linguistic on Conceptual Structures: Logical Linguistic, and Computational Issues
Searching for Objects and Properties with Logical Concept Analysis
ICCS '01 Proceedings of the 9th International Conference on Conceptual Structures: Broadening the Base
Typed Static Analysis: Application to Groundness Analysis of PROLOG and lambda-PROLOG
FLOPS '99 Proceedings of the 4th Fuji International Symposium on Functional and Logic Programming
Type Classes and Overloading in Higher-Order Logic
TPHOLs '97 Proceedings of the 10th International Conference on Theorem Proving in Higher Order Logics
A Framework for Developing Embeddable Customized Logics
LOPSTR '01 Selected papers from the 11th International Workshop on Logic Based Program Synthesis and Transformation
Generation of Efficient Interprocedural Analyzers with PAG
SAS '95 Proceedings of the Second International Symposium on Static Analysis
A File System Based on Concept Analysis
CL '00 Proceedings of the First International Conference on Computational Logic
Aster: a framework for sound customization of distributed runtime systems
ICDCS '96 Proceedings of the 16th International Conference on Distributed Computing Systems (ICDCS '96)
A Framework for Developing Embeddable Customized Logics
LOPSTR '01 Selected papers from the 11th International Workshop on Logic Based Program Synthesis and Transformation
Introduction to logical information systems
Information Processing and Management: an International Journal
A Dichotomic Search Algorithm for Mining and Learning in Domain-Specific Logics
Fundamenta Informaticae - Advances in Mining Graphs, Trees and Sequences
A modular and parameterized presentation of pregroup calculus
Information and Computation
The efficient computation of complete and concise substring scales with suffix trees
ICFCA'07 Proceedings of the 5th international conference on Formal concept analysis
Pregroup calculus as a logic functor
WoLLIC'07 Proceedings of the 14th international conference on Logic, language, information and computation
Negation, opposition, and possibility in logical concept analysis
ICFCA'06 Proceedings of the 4th international conference on Formal Concept Analysis
A Dichotomic Search Algorithm for Mining and Learning in Domain-Specific Logics
Fundamenta Informaticae - Advances in Mining Graphs, Trees and Sequences
| Hi-index | 0.00 |
Logic-based applications often use customized logics which are composed of several logics. These customized logics are also often embedded as a black-boxin 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.