On the Indiscernibility of Individuals in Logic Programming

On the Indiscernibility of Individuals in Logic Programming

Détails bibliographiques
Auteurs principaux:	Eiter, T, Gottlob, G, Leone, N
Format:	Journal article
Publié:	1997

Documents similaires

Complexity Results for Abductive Logic Programming
par: Eiter, T, et autres
Publié: (1995)

Abduction from Logic Programs: Semantics and Complexity
par: Eiter, T, et autres
Publié: (1997)

Complexity Results for Disjunctive Logic Programming and Application to Nonmonotonic Logics
par: Eiter, T, et autres
Publié: (1993)

On the Computational Cost of Disjunctive Logic Programming: Propositional Case
par: Eiter, T, et autres
Publié: (1995)

Generalized Quantifiers in Logic Programs
par: Eiter, T, et autres
Publié: (1997)

Expressiveness of Stable Model Semantics for Disjuncitve Logic Programs with Functions
par: Eiter, T, et autres
Publié: (1997)

Indiscernible universals
par: Rodriguez-Pereyra, G
Publié: (2016)

Modular Logic Programming and Generalized Quantifiers
par: Eiter, T, et autres
Publié: (1997)

Disjunctive Logic Programming over Finite Structures
par: Eiter, T, et autres
Publié: (1994)

Identity and indiscernibility
par: Ketland, J
Publié: (2011)

Indiscernibility and form
par: Per-Johan Dahl
Publié: (2018-01-01)

Indiscernibility and form
par: Per-Johan Dahl
Publié: (2018-01-01)

Complexity and Expressive Power of Logic Programming
par: Dantsin, E, et autres
Publié: (1997)

Complexity and expressive power of logic programming
par: Dantsin, E, et autres
Publié: (2001)

Representing Uncertain Concepts in Rough Description Logics via Contextual Indiscernibility Relations
par: d'Amato, C, et autres
Publié: (2013)

Representing Uncertain Concepts in Rough Description Logics via Contextual Indiscernibility Relations
par: Fanizzi, N, et autres
Publié: (2008)

The Complexity of Logic−Based Abduction
par: Eiter, T, et autres
Publié: (1995)

The Complexity of Logic−Based Abduction
par: Eiter, T, et autres
Publié: (1993)

The argument from almost indiscernibles
par: Rodriguez-Pereyra, G
Publié: (2016)

Complexity Results for Logic−Based Abduction
par: Eiter, T, et autres
Publié: (1992)

Reasoning under minimal upper bounds in propositional logic
par: Eiter, T, et autres
Publié: (2006)

On the Expressiveness of Frame Satisfiability and Fragments of Second−Order Logic
par: Eiter, T, et autres
Publié: (1998)

Hypergraph Transversal Computation and Related Problems in Logic and AI
par: Eiter, T, et autres
Publié: (2002)

Reasoning under minimal upper bounds in propositional logic
par: Eiter, T, et autres
Publié: (2006)

Symmetry, indiscernibility, and the generalist picture
par: Moller-Nielsen, T
Publié: (2015)

L’identité des indiscernables
par: Max Black
Publié: (2012-11-01)

Danto’s indiscernibility: an intercultural interpretation
par: Peng Feng
Publié: (2022-10-01)

The Complexity Class Theta2p: Recent Results and Applications in AI and Modal Logic
par: Eiter, T, et autres
Publié: (1997)

Default Logic as a Query Language
par: Cadoli, M, et autres
Publié: (1997)

Default Logic as a Query Language
par: Cadoli, M, et autres
Publié: (1994)

On the Complexity of Some Inductive Logic Programming Problems
par: Gottlob, G, et autres
Publié: (1997)

On the Complexity of Some Inductive Logic Programming Problems
par: Gottlob, G, et autres
Publié: (1999)

Existential second−order logic over strings
par: Eiter, T, et autres
Publié: (2000)

Existential Second−Order Logic over Strings
par: Eiter, T, et autres
Publié: (1998)

Indiscernibility Mask Key for Image Steganography
par: Piotr Artiemjew, et autres
Publié: (2020-05-01)

Second−Order Logic over Strings: Regular and Non−regular Fragments
par: Eiter, T, et autres
Publié: (2001)

The Bundle Theory is compatible with distinct but indiscernible particulars
par: Rodriguez-Pereyra, G
Publié: (2004)

Perceiving affordances and the problem of visually indiscernible kinds
par: Mette Kristine Hansen
Publié: (2024-09-01)

Contemporary Art and the Problem of Indiscernibles: An Adverbialist Approach
par: Tomáš Koblížek
Publié: (2023-03-01)

Local Indiscernibility Relation Reduction for Information Tables
par: Xu Li, et autres
Publié: (2022-01-01)