Results 11 to 20 of about 4,404 (137)

Weak nonmonotonic probabilistic logics

open access: yesArtificial Intelligence, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Thomas Lukasiewicz
openaire   +6 more sources

Complexity Results for Nonmonotonic Logics

open access: yesJournal of Logic and Computation, 1992
The paper provides complexity results for three problems of several nonmonotonic logics. Testing of existence of a fixed point and deciding whether a formula belongs to at least one fixed point are \(\Sigma^ P_ 2\)-complete. Deciding whether a formula belongs to all fixed points is \(\Pi^ P_ 2\)-complete.
Georg Gottlob
openaire   +5 more sources

Reasoning about Minimal Belief and Negation as Failure

open access: yes, 2011
We investigate the problem of reasoning in the propositional fragment of MBNF, the logic of minimal belief and negation as failure introduced by Lifschitz, which can be considered as a unifying framework for several nonmonotonic formalisms, including ...
Rosati, R.
core   +1 more source

Optimizing the computation of overriding

open access: yes, 2015
We introduce optimization techniques for reasoning in DLN---a recently introduced family of nonmonotonic description logics whose characterizing features appear well-suited to model the applicative examples naturally arising in biomedical domains and ...
BC Grau   +17 more
core   +1 more source

Querying disjunctive databases through nonmonotonic logics

open access: yesTheoretical Computer Science, 1995
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
BONATTI, PIERO ANDREA, T. Eiter
openaire   +4 more sources

Loop Formulas for Description Logic Programs

open access: yes, 2010
Description Logic Programs (dl-programs) proposed by Eiter et al. constitute an elegant yet powerful formalism for the integration of answer set programming with description logics, for the Semantic Web.
Brewka   +13 more
core   +1 more source

Nonmonotonic Logics and Semantics

open access: yesJournal of Logic and Computation, 2001
Tarski gave a general semantics for deductive reasoning: a formula a may be deduced from a set A of formulas iff a holds in all models in which each of the elements of A holds. A more liberal semantics has been considered: a formula a may be deduced from a set A of formulas iff a holds in all of the "preferred" models in which all the elements of A ...
openaire   +3 more sources

A Description Logic Framework for Commonsense Conceptual Combination Integrating Typicality, Probabilities and Cognitive Heuristics [PDF]

open access: yes, 2019
We propose a nonmonotonic Description Logic of typicality able to account for the phenomenon of concept combination of prototypical concepts. The proposed logic relies on the logic of typicality ALC TR, whose semantics is based on the notion of rational ...
Lieto, Antonio, Pozzato, Gian Luca
core   +3 more sources

3D Anodic Alumina Nanoarchitectures: A Decade of Progress from Foundational Science to Functional Metamaterials

open access: yesAdvanced Materials, EarlyView.
Ordered three‐dimensional anodic aluminum oxide (3D‐AAO) nanoarchitectures with longitudinal and transverse pores enable architecture‐driven metamaterials. The review maps fabrication advances, including hybrid pulse anodization, and shows how 3D‐AAO templates tailor properties across magnetism, energy, catalysis, and sensing.
Marisol Martín‐González
wiley   +1 more source

Inductive equivalence in clausal logic and nonmonotonic logic programming [PDF]

open access: yesMachine Learning, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sakama, Chiaki, Inoue, Katsumi
openaire   +2 more sources

Home - About - Disclaimer - Privacy