Filters








9,516 Hits in 5.9 sec

A Strongly Grounded Stable Model Semantics for Full Propositional Language [article]

Shahab Tasharrofi
2012 arXiv   pre-print
Moreover, using the first approach, we also extend well-founded semantics to full propositional language.  ...  There has been many efforts to extend stable model semantics so that answer set programs can use a more extensive syntax.  ...  The purpose of equilibrium model semantics is to extend stable model semantics to full propositional language.  ... 
arXiv:1211.2986v2 fatcat:6wal7eghbjbtvpjpcvyv4wolu4

Autoepistemic logic of first order and its expressive power

Li-Yan Yuan
1994 Journal of automated reasoning  
Based on full introspection, we propose the generalized stable semantics that characterizes autoepistemic reasoning processes of rational agents, and show that the breadth of the semantics covers all theories  ...  W e argue that full introspection of rational agents should be carried out by minimizing positive i n trospection and maximizing negative i n trospection.  ...  Acknowledgements The author would like to thank reviewers for providing valuable suggestions and constructive criticism to improve the presentation of the paper.  ... 
doi:10.1007/bf00881912 fatcat:mhgxvqicj5dgfizeekntr2i3ja

Separating disbeliefs from beliefs in autoepistemic reasoning [chapter]

Tomi Janhunen
1997 Lecture Notes in Computer Science  
These translations are shown to preserve a variety of semantics of default theories such as those based on default extensions, weak extensions and stationary extensions.  ...  A particular novelty of the approach is that a reasonable notion of separated stationary expansions can be established. ?  ...  Acknowledgments The author thanks Dr. Ilkka Niemel and anonymous referees for their comments and suggestions to improve the paper.  ... 
doi:10.1007/3-540-63255-7_10 fatcat:zjdag5igk5alxkzn4tlerafl6e

Page 7534 of Mathematical Reviews Vol. , Issue 98M [page]

1998 Mathematical Reviews  
On the basis of a bimodal structure we also provide a semantics for intuitionistic stable sets.”  ...  Summary: “It is well known that preferential inference relations can be semantically represented through a smooth order defined on the set of states of a preferential model, but it is also possible to  ... 

A Formal Analysis of Logic-Based Argumentation Systems [chapter]

Leila Amgoud, Philippe Besnard
2010 Lecture Notes in Computer Science  
From this base, we show how to define arguments. Then, we characterize the different semantics in terms of the subsets of the KB that are returned by each extension.  ...  We show also that stable and preferred extensions choose randomly some consistent subbases of a base.  ...  In order to have a full correspondence between the stable extensions of (Arg(Σ), R) and the maximal consistent subsets of Σ, the attack relation should be symmetric, conflict-dependent and valid.  ... 
doi:10.1007/978-3-642-15951-0_10 fatcat:gnxlirtzorbulf372brxcvsr44

Logic and Game Theory [chapter]

Giacomo Bonanno, Cédric Dégremont
2014 Outstanding Contributions to Logic  
The late Michael Bacharach was one of the first to appreciate the usefulness of logic in reasoning about games: "Game theory is full of deep puzzles, and there is often disagreement about proposed solutions  ...  We discuss the formal questions raised by the perspective consisting in taking games as models for formal languages, in particular modal languages, and how eliminative reasoning processes and solution  ...  (2011) also advocate the use of a modality for action freedom [≈ i ]ϕ with the box semantics corresponding to the relation ≈ i defined as follows: The full epistemic model has notable non-epistemic  ... 
doi:10.1007/978-3-319-06025-5_15 fatcat:rad2pvvxindxvf7ytwfwektf7y

A QBF-based formalization of abstract argumentation semantics

Ofer Arieli, Martin W.A. Caminada
2013 Journal of Applied Logic  
It is shown that within our framework we are able to model, in a simple and modular way, a wide range of semantics for abstract argumentation theory.  ...  This includes complete, grounded, preferred, stable, semi-stable, stage, ideal and eager semantics.  ...  By Proposition 34, these are exactly the semi-stable extensions of A, thus in this case the stable extensions of A and the semi-stable extensions of A coincide. Note 39.  ... 
doi:10.1016/j.jal.2013.03.009 fatcat:kksfssx7zfe2pemnifcqzaptgy

Belief, provability, and logic programs

José Júlio Alferes, Luís Moniz Pereira
1995 Journal of Applied Non-Classical Logics  
embeddings into autoepistemic logics of such programs under stable models based semantics.  ...  The main goal of this paper is to establish a nonmonotonic epistemic logic with two modalities -provability and belief -capable of expressing and comparing a variety of known semantics for extended logic  ...  Thanks to Carlos Damásio and Teodor Przymusinski for helpful discussions.  ... 
doi:10.1080/11663081.1995.10510842 fatcat:y2s4fqionjg6fnkbmysl7p5ixe

An overview of nonmonotonic reasoning and logic programming

Jack Minker
1993 The Journal of Logic Programming  
Levesque [114] generalizes Moore's notion of a stable expansion [153] to the full first-order case.  ...  They compute the stable models of a deductive database by first computing the well-founded semantics and then use a branch-and-bound strategy to compute the stable models.  ... 
doi:10.1016/0743-1066(93)90028-f fatcat:zs5h4ximffdfvapevyr6rvs4fm

Super Logic Programs [article]

Stefan Brass, Juergen Dix, Teodor C. Przymusinski
2002 arXiv   pre-print
The model-theoretic characterization via Kripke models allows one to construct finite representations of the inherently infinite static expansions.  ...  Our main results are two new and powerful characterizations of the static semant ics of these programs, one syntactic, and one model-theoretic.  ...  The authors are also greatly indebted to the anonymous reviewers for their detailed and very insightful comments, which have lead to a significant improvement of this article.  ... 
arXiv:cs/0010032v2 fatcat:p4coe5xsqbbyzol56saah2wrp4

A Bayesian Approach to Argument-Based Reasoning for Attack Estimation

Hiroyuki Kido, Keishi Okamoto
2017 Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence  
This study investigates the utilisation of acceptability semantics to statistically estimate an attack relation between arguments wherein the acceptability statuses of arguments are provided.  ...  A Bayesian network model of argument-based reasoning is defined in which Dung's theory of abstract argumentation gives the substance of Bayesian inference.  ...  Acknowledgements The authors thank Prof. Shier Ju for his kind support and Prof. Ken Satoh for valuable discussion. This study was supported by JSPS KAKENHI Grant Number 15KT0041.  ... 
doi:10.24963/ijcai.2017/36 dblp:conf/ijcai/KidoO17 fatcat:nue53bsyxrgczd2uemnvu36q4u

Chapter 6 Nonmonotonic Reasoning [chapter]

Gerhard Brewka, Ilkka Niemelä, Mirosław Truszczyński
2008 Foundations of Artificial Intelligence  
Acknowledgments We would like to thank Vladimir Lifschitz and Hudson Turner for helpful comments and suggestions.  ...  We note however, that default logic also played a role in the development of the stable-model semantics [13] and, in fact, the default-logic connection of stable models ultimately turned out to be more  ...  If the closure of K is not the intersection of all rational extensions, perhaps it is a specific rational extension, if there is a natural way to define one. We will focus on this possibility now.  ... 
doi:10.1016/s1574-6526(07)03006-4 fatcat:7r4l7tqgn5hfjok7yqbuxj5xwa

A probabilistic approach to modelling uncertain logical arguments

Anthony Hunter
2013 International Journal of Approximate Reasoning  
of the argument graph, which in turn can be used to determine the probability that a set of arguments is admissible or an extension.  ...  This is based on a probability distribution over models of the language, which can then be used to give a probability distribution over arguments that are constructed using classical logic.  ...  Let L be a propositional language, and let M L be the models of the language L.  ... 
doi:10.1016/j.ijar.2012.08.003 fatcat:bzplneeprfejrat5lfqzjuyiri

Reiter's Default Logic Is a Logic of Autoepistemic Reasoning And a Good One, Too [article]

Marc Denecker, Victor W. Marek, Miroslaw Truszczynski
2011 arXiv   pre-print
Instead, he translated a default into a certain natural language proposition and provided a formalization of the latter.  ...  and to the mismatch between informal defaults and the Reiter's formal defaults, the latter being a formal expression of the autoepistemic propositions Reiter used as a representation of informal defaults  ...  Acknowledgments The work of the first author was partially supported by FWO-Vlaanderen under project G.0489.10N. The work of the third author was partially supported by the NSF grant IIS-0913459.  ... 
arXiv:1108.3278v1 fatcat:5an7m6atife55dq4sk6vyff46q

EMIL: Extracting Meaning from Inconsistent Language

Hannes Strass, Adam Wyner, Martin Diller
2019 International Journal of Approximate Reasoning  
(Intuitively, these rules correspond to all transpositions of the disjunction ψ i .) Proposition 2. For any propositional formula ϕ, the stable sets of T ϕ correspond one-to-one with the models of ϕ.  ...  The most influential and classical version of that theme are Reiter's extension semantics for default logic [85] , Gelfond and Lifschitz' stable model semantics for normal logic programs [50] , and Dung's  ...  The resulting text does not have any answer set under the standard stable semantics for logic programs. 37 Interpreting the text under the courteous semantics does produce a unique answer set, but this  ... 
doi:10.1016/j.ijar.2019.04.010 fatcat:4dhnsbsvnrauddygf2peidgmxq
« Previous Showing results 1 — 15 out of 9,516 results