On the Indiscernibility of Individuals in Logic Programming

On the Indiscernibility of Individuals in Logic Programming

Dades bibliogràfiques
Autors principals:	Eiter, T, Gottlob, G, Leone, N
Format:	Journal article
Publicat:	1997

Ítems similars

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

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

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

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

Generalized Quantifiers in Logic Programs
per: Eiter, T, et al.
Publicat: (1997)

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

Indiscernible universals
per: Rodriguez-Pereyra, G
Publicat: (2016)

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

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

Identity and indiscernibility
per: Ketland, J
Publicat: (2011)

Indiscernibility and form
per: Per-Johan Dahl
Publicat: (2018-01-01)

Indiscernibility and form
per: Per-Johan Dahl
Publicat: (2018-01-01)

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

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

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

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

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

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

The argument from almost indiscernibles
per: Rodriguez-Pereyra, G
Publicat: (2016)

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

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

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

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

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

Symmetry, indiscernibility, and the generalist picture
per: Moller-Nielsen, T
Publicat: (2015)

L’identité des indiscernables
per: Max Black
Publicat: (2012-11-01)

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

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

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

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

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

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

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

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

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

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

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

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

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

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