14,544 Hits in 2.8 sec

Epistemic Reasoning in Logic Programs

Yan Zhang
2007 International Joint Conference on Artificial Intelligence  
In this paper, we investigate some important properties of epistemic logic programs.  ...  We also study the polysize model property for epistemic logic programs.  ...  We also study the polysize model property for epistemic logic programs.  ... 
dblp:conf/ijcai/Zhang07a fatcat:nqcs4nih4vakhl75kgzxvdiswm

Top-down Splitting Property for Epistemic Logic Programs

Stefania Costantini
2021 International Conference on Logic Programming  
In this paper we consider Epistemic Logic Programs (ELPs), which extend Answer Set Programming (ASP) with "epistemic operators".  ...  The proposal is brilliant but the problem is, that few of the semantics that have been proposed so far enjoy this new "Epistemic Splitting Property".  ...  Epistemic Logic Programs: useful Properties As argued in [25] and [26] , it would be useful if ELPs would enjoy ('mutatis mutandis') properties similar to those of ASP programs.  ... 
dblp:conf/iclp/Costantini21 fatcat:rxoxzegcxbbi7ghmlwnzftdu2a

A Splitting Set Theorem for Epistemic Specifications [article]

Richard Watson
2000 arXiv   pre-print
This characterization leads us to an algorithmic method of computing world views of a subclass of epistemic logic programs.  ...  One such language is the language of epistemic specifications. As is usual with logic programming languages, the problem of answering queries is intractable in the general case.  ...  To compute the world view of a safe, stratified, epistemic logic program therefore, one only needs to be able to compute the belief sets of extended disjunctive logic programs.  ... 
arXiv:cs/0003038v1 fatcat:3d477wcsu5gbxavvvirox7toti

Updating Epistemic Logic Programs

Y. Zhang
2008 Journal of Logic and Computation  
We also investigate essential semantic properties of epistemic logic program update.  ...  The central feature of our approach is that during an update or a sequence of updates, contradictory information is removed on a basis of minimal change under the semantics of epistemic logic programs  ...  Consider the update of an epistemic logic program P 0 by another epistemic logic program P 1 .  ... 
doi:10.1093/logcom/exn100 fatcat:az2kop5cnvg47bmjeza5di7eju

Minimal Change and Maximal Coherence for Epistemic Logic Program Updates

Yan Zhang
2003 International Joint Conference on Artificial Intelligence  
The central feature of our approach is that during an update procedure, contradictory information is removed on a basis of minimal change under the semantics of epistemic logic programs and then coherent  ...  We consider the problem of updating nonmonotonic knowledge bases represented by epistemic logic programs where disjunctive information and notions of knowledge and beliefs can be explicitly expressed.  ...  It is not difficult to observe that generally none of these two properties holds for extended logic program updates or epistemic logic program updates.  ... 
dblp:conf/ijcai/Zhang03 fatcat:r65pyvipdjcxppmeeoffcebd2i

Commonsense Reasoning to Guide Deep Learning for Scene Understanding (Extended Abstract)

Mohan Sridharan, Tiago Mota
2020 Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence  
Our architecture uses non-monotonic logical reasoning with incomplete commonsense domain knowledge, and incremental inductive learning, to guide the construction of deep network models from a small number  ...  a reduction in computational effort in comparison with an architecture based just on deep networks.  ...  Epistemic logic programs constitute a syntactic fragment of arbitrary epistemic theories that is aligned to the syntax of logic programming.  ... 
doi:10.24963/ijcai.2020/653 dblp:conf/ijcai/CabalarFC20 fatcat:krrybjfz35eftb3x3pieiauuw4

Computationally Grounded Account of Belief and Awareness for AI Agents

Natasha Alechina, Brian Logan
2010 Multi-Agent Logics, Languages, and Organisations Federated Workshops  
We then make a case for syntactic epistemic logics and describe some applications of those logics in verifying AI agents.  ...  We discuss the problem of designing a computationally grounded logic for reasoning about epistemic attitudes of AI agents, mainly concentrating on beliefs.  ...  of syntactic epistemic logics in verifying agent programming languages.  ... 
dblp:conf/mallow/AlechinaL10 fatcat:ydjciv2kj5hsxj3sxoscrmodnu

Constraint Monotonicity, Epistemic Splitting and Foundedness Could in General Be Too Strong in Answer Set Programming [article]

Yi-Dong Shen, Thomas Eiter
2020 arXiv   pre-print
Recently, the notions of subjective constraint monotonicity, epistemic splitting, and foundedness have been introduced for epistemic logic programs, with the aim to use them as main criteria respectively  ...  In conclusion, these properties should not be regarded as mandatory properties that every answer set semantics must satisfy in general.  ...  We believe that like for that extension, understanding the landscape of diverse approaches for answer set semantics of epistemic logic programs is a valuable goal, and that properties of universal validity  ... 
arXiv:2010.00191v2 fatcat:x7s57gfkujexlowz4wqdzb2jsu

A Dynamic-Logical Perspective on Quantum Behavior

A. Baltag, S. Smets
2008 Studia Logica: An International Journal for Symbolic Logic  
Our main thesis is that all the non-classical properties of quantum systems are explainable in terms of the non-classical flow of quantum information.  ...  various forms of classical information flow: the "test" operator from Dynamic Logic, the "announcement" operator from Dynamic Epistemic Logic and the "revision" operator from Belief Revision theory.  ...  This paper benefited from the fruitful discussions that took place during the ESF Exploratory Workshop on Applied Logic in the Methodology of Science in Bristol 2006.  ... 
doi:10.1007/s11225-008-9126-5 fatcat:jujcxc55c5ctjig4nu273imzxm

A Novel Symbolic Approach to Verifying Epistemic Properties of Programs

Nikos Gorogiannis, Franco Raimondi, Ioana Boureanu
2017 Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence  
We introduce a framework for the symbolic verification of epistemic properties of programs expressed in a class of general-purpose programming languages.  ...  logic.  ...  An Epistemic Logic of Programs We start from a user-specified base language and build on top of it, up to more expressive logics that specify epistemic properties of programs.  ... 
doi:10.24963/ijcai.2017/30 dblp:conf/ijcai/GorogiannisRB17 fatcat:ghciudhpznfpbdm7xojcvmjpcm

Page 5554 of Mathematical Reviews Vol. , Issue 94j [page]

1994 Mathematical Reviews  
(NL-VUAM; Amsterdam) Graded modalities in epistemic logic. (English summary) Logical foundations of computer science—Tver *92, 503-514, Lecture Notes in Comput. Sci., 620, Springer, Berlin, 1992.  ...  This al- gorithm can be used to check the validity of such formulas over all models, as well as over computations of a finite-state program (model checking).  ... 

Computation as social agency: What, how and who

Johan van Benthem
2018 Information and Computation  
One is the rise of 'epistemization' where conditions on or specifications of computational tasks refer explicitly to knowledge or beliefs of the agents performing these tasks.  ...  The other channel is the rise of games as a paradigm for interactive computation, leading to 'gamification' of computing tasks and of logical notions themselves.  ...  We thank the many audiences of colleagues and students that provided feedback. 29 10 References S. Abramsky, 2008A, 'Information, Processes and Games', in P.  ... 
doi:10.1016/j.ic.2017.09.009 fatcat:i63hs6rcejcgpnngxgk6a76wxa

Thirty years of Epistemic Specifications [article]

Jorge Fandinno, Wolfgang Faber, Michael Gelfond
2021 arXiv   pre-print
The language of epistemic specifications and epistemic logic programs extends disjunctive logic programs under the stable model semantics with modal constructs called subjective literals.  ...  Under consideration in Theory and Practice of Logic Programming (TPLP)  ...  List of solvers for computing the world views of epistemic logic programs.  ... 
arXiv:2108.07669v2 fatcat:ouszrad5q5felhvk2xdz2u4zwi

Nested Epistemic Logic Programs [chapter]

Kewen Wang, Yan Zhang
2005 Lecture Notes in Computer Science  
In this paper we first introduce the epistemic HT-logic, and then propose a more general extension of logic programs called nested epistemic logic programs.  ...  We prove that equilibrium view semantics extends both the answer sets of nested logic programs and the world views of epistemic logic programs.  ...  In particular, the comments from one referee greatly helped the improvement of the paper.  ... 
doi:10.1007/11546207_22 fatcat:l6sk5734xbcgxfyn4obago72r4

What about Linear Logic in Computer Science?

2013 Acta Polytechnica Hungarica  
We start with a short overview of linear logic with an emphasis on the special properties of linear implication and exponential operators.  ...  In this paper we discuss several useful features of linear logic especially from the viewpoint of computing science.  ...  During our research, we have recognized several interesting properties and possibilities of linear logic:  In the sense of Curry-Howard correspondence, functional programming can be regarded as logical  ... 
doi:10.12700/aph.10.04.2013.4.9 fatcat:vk55sjgg2fgohcfbbglc6tbgva
« Previous Showing results 1 — 15 out of 14,544 results