82,140 Hits in 6.8 sec

Merging Information Under Constraints: A Logical Framework

S. Konieczny
2002 Journal of Logic and Computation  
The paper considers the problem of merging several belief bases in the presence of integrity constraints and proposes a logical characterization of operators having a majority behaviour or a consensual  ...  The close connection between belief revision and merging operators is shown and it is shown that the proposal extends the pure merging case (i.e. without integrity constraints) studied in a previous work  ...  Merging Information Under Constraints: A Logical Framework 781 Reflexivity: From (IC0) and (IC1) we have that ³ Á´© µ ³ Á . So Á © Á.  ... 
doi:10.1093/logcom/12.5.773 fatcat:jjuuahqelfaezk2gusap7ianje


1998 International Journal of Cooperative Information Systems  
We apply our semantics to the special case when the theories to be merged represent relational databases under integrity constraints.  ...  We then present a w ay o f merging databases that have di erent or con icting schemas caused by problems such as synonyms, homonyms or type c on icts mentioned in the schema integration literature.  ...  His framework is based on a non-classical logic, i.e. annotated logic, while ours is developed on top of the classical logic.  ... 
doi:10.1142/s0218843098000040 fatcat:vm7kjsgaczglfcxldb2a54rg4u

A Rewriting Logic Framework for Soft Constraints

Martin Wirsing, Grit Denker, Carolyn Talcott, Andy Poggio, Linda Briesemeister
2007 Electronical Notes in Theoretical Computer Science  
In this paper we present a framework for prototyping of soft constraintsà la Bistarelli, Montanari and Rossi in Rewriting Logic.  ...  in our prototypical Rewriting Logic framework for soft constraints, and embed our soft constraint solver in SRI's Policy-Aware, Goal-Oriented Distributed Architecture (PAGODA) for modelling radio networks  ...  In this paper, we present a framework for prototyping of soft constraintsà la Bistarelli, Montanari and Rossi in Rewriting Logic [7] .  ... 
doi:10.1016/j.entcs.2007.06.015 fatcat:7l54yv6cszenfa2joc2j3mhspe

A framework to incorporate non-monotonic reasoning into constraint logic programming

Jürgen Dix, Frieder Stolzenburg
1998 The Journal of Logic Programming  
In this paper we present a theoretical framework by de®ning a calculus of program transformations that apply directly to rules with variables and function symbols.  ...  In summary, this work yields the basis for a general combination of two paradigms: constraint logic programming and non-monotonic reasoning. Ó 1998 Elsevier Science Inc. All rights reserved.  ...  This is a completely revised and extended version of Ref.  ... 
doi:10.1016/s0743-1066(98)10003-1 fatcat:ohlybnakcvckdojybwreszkps4

Merging taxonomies under RCC-5 algebraic articulations

David Thau, Shawn Bowers, Bertram Ludäscher
2008 Proceeding of the 2nd international workshop on Ontologies and nformation systems for the semantic web - ONISW '08  
We present an algorithm for merging taxonomies that have been related using articulations given as RCC-5 constraints.  ...  Given a set of correspondences between two taxonomies, it is often necessary to "merge" the taxonomies, thereby creating a unified taxonomy (e.g., that can then be used by data integration and discovery  ...  A primary advantage of the CT framework is the ability to apply a variety of taxonomic constraints when reasoning and merging across taxonomies.  ... 
doi:10.1145/1458484.1458492 dblp:conf/cikm/ThauBL08 fatcat:l5d47ojxj5epdiklgjil2rxu4a

A Logical Framework for Modularity of Ontologies

Bernardo Cuenca Grau, Ian Horrocks, Yevgeny Kazakov, Ulrike Sattler
2007 International Joint Conference on Artificial Intelligence  
, which enables the controlled merging of ontologies.  ...  Modern ontology languages, such as OWL, are logic-based, and thus a useful notion of modularity needs to take the semantics of ontologies and their implications into account.  ...  In this paper, we propose a logic-based framework for modularity of ontologies in which we distinguish between external and local symbols of ontologies.  ... 
dblp:conf/ijcai/GrauHKS07 fatcat:dxkngas5ena6pawla6hyw2p4x4

A Linear Logical Framework

Iliano Cervesato, Frank Pfenning
2002 Information and Computation  
We present the linear type theory λ & as the formal basis for LLF, a conservative extension of the logical framework LF.  ...  LLF combines the expressive power of dependent types with linear logic to permit the natural and concise representation of a whole new class of deductive systems, namely those dealing with state.  ...  ACKNOWLEDGMENT We thank the anonymous referees for their valuable comments, which helped improve this paper as a whole.  ... 
doi:10.1006/inco.2001.2951 fatcat:iwwv3nwehnbv5ehjm4oeysrudi

A Modal Logic Framework for Multi-agent Belief Fusion [article]

Churn-Jung Liau
2002 arXiv   pre-print
Every ordering for the reliability of the agents is represented by a modal operator, so we can reason with the merged results under different situations.  ...  This paper is aimed at providing a uniform framework for reasoning about beliefs of multiple agents and their fusion.  ...  This logical framework is further extended to dealing with integrity constraints in [43] .  ... 
arXiv:cs/0201020v1 fatcat:6ceshyq6fvasbix4kdbeptqfkm

A Hybrid Data Cleaning Framework using Markov Logic Networks [article]

Yunjun Gao, Congcong Ge, Xiaoye Miao, Haobo Wang, Bin Yao, Qing Li
2019 arXiv   pre-print
In this paper, we present a novel hybrid data cleaning framework on top of Markov logic networks (MLNs), termed as MLNClean, which is capable of cleaning both schema-level and instance-level errors.  ...  With the increase of dirty data, data cleaning turns into a crux of data analysis.  ...  The framework MLNClean receives a dirty dataset together with a set of integrity constraints (ICs).  ... 
arXiv:1903.05826v1 fatcat:dz3rwkqjqbfk7h3nd247n2tt6e

A consistency-based framework for merging knowledge bases

James P. Delgrande, Torsten Schaub
2007 Journal of Applied Logic  
We present a framework for expressing various merging operators for belief sets. This framework generalises our earlier work on consistency-based belief revision and contraction.  ...  This approach then accords with one's intuitions as to what a "merge" operator should do. The second approach is more akin to a generalised belief revision operator.  ...  In this paper, we develop a specific framework for defining merge operations. This framework extends our earlier work in belief revision.  ... 
doi:10.1016/j.jal.2006.03.005 fatcat:g5ik3saspzellnhtx5jpbhu7iu

A Logic Framework for P2P Deductive Databases [article]

Luciano Caroprese, Ester Zumpano
2019 arXiv   pre-print
This paper presents a logic framework for modeling the interaction among deductive databases in a P2P (Peer to Peer) environment.  ...  Under consideration in Theory and Practice of Logic Programming (TPLP).  ...  The paper presents a logic-based framework for modeling the interaction among peers.  ... 
arXiv:1905.01545v1 fatcat:ea5gjt3jgzdj3lpk2m7gfqjyoa

A modal logic framework for multi-agent belief fusion

Churn-Jung Liau
2005 ACM Transactions on Computational Logic  
This paper provides a modal logic framework for reasoning about multi-agent belief and its fusion.  ...  We also develop a tableau proof system for the logics and prove the complexity result for the satisfiability and validity problems of these logics.  ...  We now describe a generic approach for such an extension. To accommodate such kind of merging operators in the modal logic framework, we use an extended language L e .  ... 
doi:10.1145/1042038.1042043 fatcat:q6fvbkgj7zhnnlc5wod5l6zbde

Towards a Logic-Based Unifying Framework for Computing [article]

Robert Kowalski, Fariba Sadri
2014 arXiv   pre-print
In this paper we propose a logic-based, framework inspired by artificial intelligence, but scaled down for practical database and programming applications.  ...  Computation in the framework is viewed as the task of generating a sequence of state transitions, with the purpose of making an agent's goals all true.  ...  The paper is organised as follows: Section 2 introduces the framework informally by means of examples, and aims to give a flavour of the breadth of its applications.  ... 
arXiv:1301.6905v2 fatcat:ff3obn7povf2bn5zkvy4wxzqvm

Reasoning with multiple-source information in a possibilistic logic framework

Salem Benferhat, Claudio Sossai
2006 Information Fusion  
This paper addresses the problem of merging uncertain information in the framework of possibilistic logic.  ...  A proof system in a sequent form is given, sound and complete with respect to the possibilistic logic semantics.  ...  These two connectives are enough to define a logic for merging possibilistic information.  ... 
doi:10.1016/j.inffus.2005.01.006 fatcat:eyljz5tyk5es5ozfrnxojdhabu

Protein Hypernetworks: a Logic Framework for Interaction Dependencies and Perturbation Effects in Protein Networks [article]

Johannes Köster, Eli Zamir, Sven Rahmann
2011 arXiv   pre-print
Therefore, a comprehensive approach for integrating and using information about such dependencies is required.  ...  Conclusion: Protein hypernetworks are a consistent formal framework for modeling dependencies between protein interactions within protein networks.  ...  We use propositional logic to model interaction constraints, and provide a flexible framework for their system-wise representation, called protein hypernetworks (Section 2).  ... 
arXiv:1106.2562v1 fatcat:sppupudh5veejg57q2c4thniqy
« Previous Showing results 1 — 15 out of 82,140 results