Filters








33 Hits in 4.0 sec

Integrating actions and state constraints: A closed-form solution to the ramification problem (sometimes)

Sheila A. McIlraith
2000 Artificial Intelligence  
Observing that our minimization policy is simply an instance of prioritized circumscription, we exploit results of Lifschitz (1985) on computing circumscription to show that computing the prioritized circumscription  ...  The second major contribution of this paper is an independent semantic justification for this closed-form solution.  ...  I would particularly like to acknowledge Fangzhen Lin for providing helpful comments on the circumscription results, and for helping mathematically articulate my intuitions regarding the existence of a  ... 
doi:10.1016/s0004-3702(99)00087-9 fatcat:uin3zmwfavgzzlh2y6w475icy4

Splitting an operator

Joost Vennekens, David Gilis, Marc Denecker
2006 ACM Transactions on Computational Logic  
Together with the framework of approximation theory, a general fixpoint theory for arbitrary operators, this gives us a uniform and powerful way of deriving splitting results for each logic with a fixpoint  ...  We demonstrate the usefulness of these results, by generalizing existing results for logic programming, auto-epistemic logic and default logic.  ...  is in fact a stratifiable operator.  ... 
doi:10.1145/1183278.1183284 fatcat:sf2tgq3pj5frhd7ibvj7xcfah4

Splitting an operator

Joost Vennekens, David Gilis, Marc Denecker
2006 ACM Transactions on Computational Logic  
Together with the framework of approximation theory, a general fixpoint theory for arbitrary operators, this gives us a uniform and powerful way of deriving splitting results for each logic with a fixpoint  ...  We demonstrate the usefulness of these results, by generalizing existing results for logic programming, auto-epistemic logic and default logic.  ...  is in fact a stratifiable operator.  ... 
doi:10.1145/1166109.1166115 fatcat:tbaliy5co5acnnrzprpm2m4y7m

Modelling Object Typicality in Description Logics [chapter]

Katarina Britz, Johannes Heidema, Thomas Meyer
2009 Lecture Notes in Computer Science  
We define a general preferential semantic framework for reasoning with object typicality in description logics.  ...  Nonmonotonicity: (I, ≤ J ) C ∼j D does not necessarily imply (I, ≤ J ) C C ∼j D for any j ∈ J . Defeasibility: (I, ≤ J ) C ∼j D does not necessarily imply (I, ≤ J ) C D for any j ∈ J .  ...  Firstly, a whole range of concrete combination operators have been studied.  ... 
doi:10.1007/978-3-642-10439-8_51 fatcat:abzaynlifjf5dgim7sot3ouepy

The s-semantics approach: Theory and applications

Annalisa Bossi, Maurizio Gabbrielli, Giorgio Levi, Maurizio Martelli
1994 The Journal of Logic Programming  
The semantics in terms of extended interpretations can be obtained as a result of both an operational (top-down) and a fixpoint (bottom-up) construction.  ...  This paper is a general overview of an approach to the semantics of logic programs whose aim is to find notions of models which really capture the operational semantics, and are, therefore, useful for  ...  It is a bottomup semantics for stratified normal programs which generalizes to the nonground case the construction of [4] .  ... 
doi:10.1016/0743-1066(94)90026-4 fatcat:5d5ypkaogvafhk2lxz43h3c4mq

Knowledge representation with logic programs [chapter]

Gerhard Brewka, Jürgen Dix
1998 Lecture Notes in Computer Science  
In this tutorial-overview, which resulted from a lecture course given by the authors at the European Summer School in Logic, Language and Information 1997 in Aix-en-Provence (  ...  Nonmonotonic modal logics using a modal operator to represent consistency or (dis-) belief. These logics are nonmonotonic since conclusions may depend on disbelief.  ...  ( $ We want to show that a minor reformulation of the fixpoint operator can overcome this weakness and leads to better results.  ... 
doi:10.1007/bfb0054788 fatcat:5fa5wrvqgnco5kdgef2zcsrysm

Generating Ontologies from Templates: A Rule-Based Approach for Capturing Regularity [article]

Henrik Forssell, Christian Kindermann, Daniel P. Lupp, Uli Sattler, Evgenij Thorstensen
2018 arXiv   pre-print
This language is based on ontology templates (OTTR), a framework for capturing recurring patterns of axioms in ontological modelling. The language and our results are independent of any specific DL.  ...  We define the language and its semantics, including the case of negation-as-failure, investigate reasoning over ontologies specified using our language, and show results about the decidability of useful  ...  We extend the definition of the expansions defined in Section 3, define suitable notions of semi-positive GBoxes and semantics for stratified GBoxes, and prove the corresponding uniqueness results.  ... 
arXiv:1809.10436v1 fatcat:r2bl3pqhnvbvnl2vwvkeqiaioe

Modeling generalized implicatures using non-monotonic logics

Jacques Wainer
2006 Journal of Logic, Language and Information  
This paper reports on an approach to model generalized implicatures using nonmonotonic logics.  ...  compositional, is based on the idea of compositional semantics, where the implicatures carried by a sentence are constructed from the implicatures carried by its constituents, but it also includes some aspects nonmonotonic  ...  Among other research in nonmonotonic logics and language we can point out the work of Marcu and Hirst (1996) who proposes a stratified logic approach to model defeasible pragmatic inferences.  ... 
doi:10.1007/s10849-006-9025-y fatcat:jkffihak2bgwbpoulrjhy7s7si

The informal semantics of Answer Set Programming: A Tarskian perspective [article]

Marc Denecker, Yuliya Lierler, Miroslaw truszczynski, Joost Vennekens
2019 arXiv   pre-print
In this paper, we develop a new theory of the informal semantics of answer set programming, which is formulated in the Tarskian setting and based on Frege's compositionality principle.  ...  In 1999, the seminal papers on answer set programming proposed to use this logic for a different purpose, namely, to model and solve search problems.  ...  For sharing their views on topics related to this paper, we would like to thank the following people: Maurice Bruynooghe, Vladimir Lifschitz, Michael Gelfond and Eugenia Ternovska.  ... 
arXiv:1901.09125v1 fatcat:d3nihpodxvacthtppm433ddonq

Analyzing Semantics of Aggregate Answer Set Programming Using Approximation Fixpoint Theory

LINDE VANBESIEN, MAURICE BRUYNOOGHE, MARC DENECKER
2022 Theory and Practice of Logic Programming  
The problem of selecting an appropriate formalization of aggregates for answer set programming (ASP) remains unsettled.  ...  We introduce an AFT formalization equivalent with the Gelfond–Lifschitz reduct for basic ASP programs and we extend it to handle aggregates.  ...  In LP and ASP, it is often taken for granted that LP's nonmonotonicity is due to its non-classical negation not.  ... 
doi:10.1017/s1471068422000126 fatcat:2t6cjbkojjhrtlju5jewpubmqm

Smoldering Combustion in Oil Shales: Influence of Calcination and Pyrolytic Reactions

Mustafa Elayeb, Gérald Debenest, Valeri V. Mourzenko, Jean-François Thovert
2016 Transport in Porous Media  
Nevertheless, a successful heuristic model for the spread of the hot and potentially reactive region can be stated, which provides an avenue for further studies.  ...  One of them, Pe F,s , provides an a priori criterion for the validity of a local equilibrium hypothesis and for the applicability of standard homogenized formulations.  ...  The results are presented and commented in Sect. 5 for a stratified medium and in Sect. 6 for a staggered array of cylinders.  ... 
doi:10.1007/s11242-016-0805-9 fatcat:a5w2i24npffe7cthwjncyg5ufi

An Ordinal View of Independence with Application to Plausible Reasoning [article]

Didier Dubois, Luis Farinas del Cerro, Andreas Herzig, Henri Prade
2013 arXiv   pre-print
These two have enough expressive power to support the whole possibility theory, and a complete axiomatization is provided for the strongest one.  ...  We suppose given a theory K and an AGM revision operation * (Giirdenfors, 1988) . K* A represents the result of revising K by A.  ...  Moreover there is no result that allow us to aggregate (via the min operation) a conditional possibility distribution into a global joint one (see, e.g., Fonck 1993) .  ... 
arXiv:1302.6803v1 fatcat:v4nqjpxa5fh53fio53wyeczn6u

Analyzing Semantics of Aggregate Answer Set Programming Using Approximation Fixpoint Theory [article]

Linde Vanbesien, Maurice Bruynooghe, Marc Denecker
2022 arXiv   pre-print
This paper is under consideration for acceptance in TPLP.  ...  The problem of selecting an appropriate formalisation of aggregates for answer set programming (ASP) remains unsettled.  ...  In LP and ASP, it is often taken for granted that LP's nonmonotonicity is due to its non-classical negation not.  ... 
arXiv:2104.14789v5 fatcat:yiccieossng7jbfxh3kfulyiuy

Dynamic mixing in magma bodies: Theory, simulations, and implications

Curtis M. Oldenburg, Frank J. Spera, David A. Yuen, Granville Sewell
1989 Journal of Geophysical Research  
A viscous (i.e., crystal laden), large (d -5 kin) magma body heated weakly from below and initially strongly chemically stratified will remain unmixed for several Ma.  ...  For parameters within the ranges investigated, /mix is roughly proportional to Vrt/2Let/2Rr 2Rq .1 for the heating from below scenario.  ...  We are grateful to Anne Boyd for her help in preparing this manuscript.  ... 
doi:10.1029/jb094ib07p09215 fatcat:yilk5t66tvgmhgayo5fg7zcdla

Page 73 of Mathematical Reviews Vol. 27, Issue Index [page]

Mathematical Reviews  
A deductive system for existential least fixpoint logic. (English summary) 95a:03039 — Stratified least fixpoint logic.  ...  An operational approach to combining classical set theory and functional programming languages.  ... 
« Previous Showing results 1 — 15 out of 33 results