On the Indiscernibility of Individuals in Logic Programming

On the Indiscernibility of Individuals in Logic Programming

Bibliographic Details
Main Authors:	Eiter, T, Gottlob, G, Leone, N
Format:	Journal article
Published:	1997

Similar Items

Complexity Results for Abductive Logic Programming
by: Eiter, T, et al.
Published: (1995)

Abduction from Logic Programs: Semantics and Complexity
by: Eiter, T, et al.
Published: (1997)

Complexity Results for Disjunctive Logic Programming and Application to Nonmonotonic Logics
by: Eiter, T, et al.
Published: (1993)

On the Computational Cost of Disjunctive Logic Programming: Propositional Case
by: Eiter, T, et al.
Published: (1995)

Generalized Quantifiers in Logic Programs
by: Eiter, T, et al.
Published: (1997)

Expressiveness of Stable Model Semantics for Disjuncitve Logic Programs with Functions
by: Eiter, T, et al.
Published: (1997)

Indiscernible universals
by: Rodriguez-Pereyra, G
Published: (2016)

Modular Logic Programming and Generalized Quantifiers
by: Eiter, T, et al.
Published: (1997)

Disjunctive Logic Programming over Finite Structures
by: Eiter, T, et al.
Published: (1994)

Identity and indiscernibility
by: Ketland, J
Published: (2011)

Indiscernibility and form
by: Per-Johan Dahl
Published: (2018-01-01)

Indiscernibility and form
by: Per-Johan Dahl
Published: (2018-01-01)

Complexity and Expressive Power of Logic Programming
by: Dantsin, E, et al.
Published: (1997)

Complexity and expressive power of logic programming
by: Dantsin, E, et al.
Published: (2001)

Representing Uncertain Concepts in Rough Description Logics via Contextual Indiscernibility Relations
by: d'Amato, C, et al.
Published: (2013)

Representing Uncertain Concepts in Rough Description Logics via Contextual Indiscernibility Relations
by: Fanizzi, N, et al.
Published: (2008)

The Complexity of Logic−Based Abduction
by: Eiter, T, et al.
Published: (1995)

The Complexity of Logic−Based Abduction
by: Eiter, T, et al.
Published: (1993)

The argument from almost indiscernibles
by: Rodriguez-Pereyra, G
Published: (2016)

Complexity Results for Logic−Based Abduction
by: Eiter, T, et al.
Published: (1992)

Reasoning under minimal upper bounds in propositional logic
by: Eiter, T, et al.
Published: (2006)

On the Expressiveness of Frame Satisfiability and Fragments of Second−Order Logic
by: Eiter, T, et al.
Published: (1998)

Hypergraph Transversal Computation and Related Problems in Logic and AI
by: Eiter, T, et al.
Published: (2002)

Reasoning under minimal upper bounds in propositional logic
by: Eiter, T, et al.
Published: (2006)

Symmetry, indiscernibility, and the generalist picture
by: Moller-Nielsen, T
Published: (2015)

L’identité des indiscernables
by: Max Black
Published: (2012-11-01)

Danto’s indiscernibility: an intercultural interpretation
by: Peng Feng
Published: (2022-10-01)

The Complexity Class Theta2p: Recent Results and Applications in AI and Modal Logic
by: Eiter, T, et al.
Published: (1997)

Default Logic as a Query Language
by: Cadoli, M, et al.
Published: (1997)

Default Logic as a Query Language
by: Cadoli, M, et al.
Published: (1994)

On the Complexity of Some Inductive Logic Programming Problems
by: Gottlob, G, et al.
Published: (1997)

On the Complexity of Some Inductive Logic Programming Problems
by: Gottlob, G, et al.
Published: (1999)

Existential second−order logic over strings
by: Eiter, T, et al.
Published: (2000)

Existential Second−Order Logic over Strings
by: Eiter, T, et al.
Published: (1998)

Indiscernibility Mask Key for Image Steganography
by: Piotr Artiemjew, et al.
Published: (2020-05-01)

Second−Order Logic over Strings: Regular and Non−regular Fragments
by: Eiter, T, et al.
Published: (2001)

The Bundle Theory is compatible with distinct but indiscernible particulars
by: Rodriguez-Pereyra, G
Published: (2004)

Perceiving affordances and the problem of visually indiscernible kinds
by: Mette Kristine Hansen
Published: (2024-09-01)

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

Local Indiscernibility Relation Reduction for Information Tables
by: Xu Li, et al.
Published: (2022-01-01)