Results 61 to 70 of about 783,609 (145)

Modular Nonmonotonic Logic Programming Revisited [PDF]

open access: yes, 2009
Recently, enabling modularity aspects in Answer Set Programming (ASP) has gained increasing interest to ease the composition of program parts to an overall program. In this paper, we focus on modular nonmonotonic logic programs (MLP) under the answer set semantics, whose modules may have contextually dependent input provided by other modules. Moreover,
Minh Dao-Tran   +3 more
openaire   +1 more source

Special Issue on Ontologies and Data Management: Part II. [PDF]

open access: yesKunstliche Intell (Oldenbourg), 2020
Schneider T, Å imkus M.
europepmc   +1 more source

Set-Theoretic Completeness for Epistemic and Conditional Logic

open access: yes, 1999
The standard approach to logic in the literature in philosophy and mathematics, which has also been adopted in computer science, is to define a language (the syntax), an appropriate class of models together with an interpretation of formulas in the ...
Halpern, Joseph Y.
core   +4 more sources

Independence and abstract multiplication

open access: yes, 2010
We investigate the notion of independence, which is at the basis of many, seemingly unrelated, properties of logic like Rational Monotony in non-monotonic logics, and interpolation ...
Gabbay, Dov Null, Schlechta, Karl
core   +1 more source

Reasoning about exceptions in ontologies: from the lexicographic closure to the skeptical closure

open access: yes, 2018
Reasoning about exceptions in ontologies is nowadays one of the challenges the description logics community is facing. The paper describes a preferential approach for dealing with exceptions in Description Logics, based on the rational closure.
Giordano, Laura, Gliozzi, Valentina
core  

Formal Methods for Nonmonotonic and Related Logics

open access: yesCambridge International Law Journal, 2018
K. Schlechta
semanticscholar   +1 more source

Precise Propagation of Upper and Lower Probability Bounds in System P

open access: yes, 2000
In this paper we consider the inference rules of System P in the framework of coherent imprecise probabilistic assessments. Exploiting our algorithms, we propagate the lower and upper probability bounds associated with the conditional assertions of a ...
Gilio, Angelo
core  

Home - About - Disclaimer - Privacy