Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- ArticleOctober 2023
Unknown Truths and Unknowable Truths
AbstractNotions of unknown truths and unknowable truths are important in formal epistemology, which are related to each other in e.g. Fitch’s paradox of knowability. Although there have been some logical research on the notion of unknown truths and some ...
- ArticleOctober 2023
- research-articleJanuary 2023
Logics for Temporal Information Systems in Rough Set Theory
ACM Transactions on Computational Logic (TOCL), Volume 24, Issue 1Article No.: 2, Pages 1–29https://doi.org/10.1145/3549075The article discusses temporal information systems (TISs) that add the dimension of time to complete or incomplete information systems. Through TISs, one can accommodate the possibility of domains or attribute values for objects changing with time or the ...
- research-articleNovember 2021
Axiomatizations and computability of weighted monadic second-order logic
LICS '21: Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer ScienceArticle No.: 11, Pages 1–13https://doi.org/10.1109/LICS52264.2021.9470615Weighted monadic second-order logic is a weighted extension of monadic second-order logic that captures exactly the behaviour of weighted automata. Its semantics is parameterized with respect to a semiring on which the values that weighted formulas ...
- research-articleJune 2021
Strategic Knowledge Acquisition
ACM Transactions on Computational Logic (TOCL), Volume 22, Issue 3Article No.: 17, Pages 1–18https://doi.org/10.1145/3459993The article proposes a trimodal logical system that can express the strategic ability of coalitions to learn from their experience. The main technical result is the completeness of the proposed system.
-
- ArticleDecember 2023
Hope for Epistemic Reasoning with Faulty Agents!
Selected Reflections in Language, Logic, and InformationPages 93–108https://doi.org/10.1007/978-3-031-50628-4_6AbstractIn this paper, we study a new epistemic modal operator, termed hope, which has been introduced recently in the context of a novel epistemic reasoning framework for distributed multi-agent systems with arbitrarily (“byzantine”) faulty agents. It ...
- research-articleNovember 2018
A Simple Modal Logic for Reasoning in Multigranulation Rough Set Model
ACM Transactions on Computational Logic (TOCL), Volume 19, Issue 4Article No.: 30, Pages 1–23https://doi.org/10.1145/3274664The notions of strong/weak approximations have been studied extensively in recent years. These approximations are based on a structure of the form (W,{Ri}i∈ N), called the multiple-source approximation system, where Ri is an equivalence relation on W, ...
- research-articleJuly 2018
Second-Order Know-How Strategies
AAMAS '18: Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent SystemsPages 390–398The fact that a coalition has a strategy does not mean that the coalition knows what the strategy is. If the coalition knows the strategy, then such a strategy is called a know-how strategy of the coalition. The paper proposes the notion of a second-...
- research-articleDecember 2017
Information Flow under Budget Constraints
ACM Transactions on Computational Logic (TOCL), Volume 18, Issue 4Article No.: 32, Pages 1–26https://doi.org/10.1145/3152768Although first proposed in the database theory as properties of functional dependencies between attributes, Armstrong’s axioms capture general principles of information flow by describing properties of dependencies between sets of pieces of information. ...
- research-articleMay 2017
Coalition Power in Epistemic Transition Systems
AAMAS '17: Proceedings of the 16th Conference on Autonomous Agents and MultiAgent SystemsPages 723–731The paper proposes a bimodal logic that describes an interplay between coalition strategies and distributed knowledge. Unlike the existing literature, the paper assumes that a strategy must be not only executable but also verifiable. That is, the ...
- research-articleJune 2016
SQL Schema Design: Foundations, Normal Forms, and Normalization
SIGMOD '16: Proceedings of the 2016 International Conference on Management of DataPages 267–279https://doi.org/10.1145/2882903.2915239Normalization helps us find a database schema at design time that can process the most frequent updates efficiently at run time. Unfortunately, relational normalization only works for idealized database instances in which duplicates and null markers are ...
- research-articleMay 2016
Attachment Centrality: An Axiomatic Approach to Connectivity in Networks
AAMAS '16: Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent SystemsPages 168–176Centrality indices aim to quantify the importance of nodes or edges in a network. A number of new centrality indices have recently been proposed to try and capture the role of nodes in connecting the network. While these indices seem to deliver new ...
- research-articleJanuary 2016
A consistent allocation and related results under fuzzy transferable-utility behavior1
Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology (JIFS), Volume 30, Issue 6Pages 3167–3175https://doi.org/10.3233/IFS-152060Based on the supreme-utilities among fuzzy sets, we propose the supreme-consistent value. Further, we propose some equivalent relations to axiomatize the family of all fuzzy solutions that admit a potential. Based on these equivalent relations, two ...
- research-articleNovember 2015
Differential Game Logic
ACM Transactions on Computational Logic (TOCL), Volume 17, Issue 1Article No.: 1, Pages 1–51https://doi.org/10.1145/2817824Differential game logic (dGL) is a logic for specifying and verifying properties of hybrid games, i.e., games that combine discrete, continuous, and adversarial dynamics. Unlike hybrid systems, hybrid games allow choices in the system dynamics to be ...
- research-articleOctober 2015
Inclusion Dependencies Reloaded
CIKM '15: Proceedings of the 24th ACM International on Conference on Information and Knowledge ManagementPages 1361–1370https://doi.org/10.1145/2806416.2806539Inclusion dependencies form one of the most fundamental classes of integrity constraints. Their importance in classical data management is reinforced by modern applications such as data cleaning and profiling, entity resolution and schema matching. ...
- research-articleMay 2015
Budget-Constrained Knowledge in Multiagent Systems
AAMAS '15: Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent SystemsPages 219–226The paper introduces a modal logical system for reasoning about knowledge in which information available to agents might be constrained by the available budget. Although the system lacks an equivalent of the standard Negative Introspection axiom from ...
- research-articleDecember 2014
Mathematical fuzzy logic with many dual hedges
SoICT '14: Proceedings of the 5th Symposium on Information and Communication TechnologyPages 7–13https://doi.org/10.1145/2676585.2676619This paper proposes an axiomatization of mathematical fuzzy logic with many dual hedges. We extend an axiomatization of mathematical fuzzy logic with one truth-stressing and one truth-depressing hedges as an expansion of a core fuzzy logic with new ...
- research-articleNovember 2014
On Independence Atoms and Keys
CIKM '14: Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge ManagementPages 1229–1238https://doi.org/10.1145/2661829.2662058Uniqueness and independence are two fundamental properties of data. Their enforcement in knowledge systems can lead to higher quality data, faster data service response time, better data-driven decision making and knowledge discovery from data. The ...
- ArticleMarch 2014
Implication and Axiomatization of Functional Constraints on Patterns with an Application to the RDF Data Model
FoIKS 2014: Proceedings of the 8th International Symposium on Foundations of Information and Knowledge Systems - Volume 8367Pages 250–269https://doi.org/10.1007/978-3-319-04939-7_12Akhtar et al. introduced equality-generating constraints and functional constraints as an initial step towards dependency-like integrity constraints for RDF data [1]. Here, we focus on functional constraints. The usefulness of functional constraints is ...
- articleDecember 2013
On the Axiomatization of the Satiation and Habit Formation Utility Models
<P>We propose a preference condition called shifted difference independence to axiomatize a general habit formation and satiation model GHS. This model allows for a general habit formation and satiation function that contain many functional forms in the ...