On the Indiscernibility of Individuals in Logic Programming

On the Indiscernibility of Individuals in Logic Programming

Detalles Bibliográficos
Main Authors:	Eiter, T, Gottlob, G, Leone, N
Formato:	Journal article
Publicado:	1997

Títulos similares

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

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

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

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

Generalized Quantifiers in Logic Programs
por: Eiter, T, et al.
Publicado: (1997)

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

Indiscernible universals
por: Rodriguez-Pereyra, G
Publicado: (2016)

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

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

Identity and indiscernibility
por: Ketland, J
Publicado: (2011)

Indiscernibility and form
por: Per-Johan Dahl
Publicado: (2018-01-01)

Indiscernibility and form
por: Per-Johan Dahl
Publicado: (2018-01-01)

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

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

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

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

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

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

The argument from almost indiscernibles
por: Rodriguez-Pereyra, G
Publicado: (2016)

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

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

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

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

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

Symmetry, indiscernibility, and the generalist picture
por: Moller-Nielsen, T
Publicado: (2015)

L’identité des indiscernables
por: Max Black
Publicado: (2012-11-01)

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

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

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

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

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

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

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

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

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

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

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

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

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

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