Reasoning under minimal upper bounds in propositional logic

Reasoning under minimal upper bounds in propositional logic

Mostrar otras versiones (1)

Detalles Bibliográficos
Autores principales:	Eiter, T, Gottlob, G
Formato:	Journal article
Publicado:	2006

Ejemplares similares

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

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

Propositional Circumscription and Extended Closed−World Reasoning are IIp2−Complete
por: Eiter, T, et al.
Publicado: (1993)

Complexity of Propositional Knowledge Base Revision
por: Eiter, T, et al.
Publicado: (1992)

On the Complexity of Propositional Knowledge Base Revision‚ Updates‚ and Counterfactuals
por: Eiter, T, et al.
Publicado: (1992)

On the Complexity of Propositional Knowledge Base Revision‚ Updates‚ and Counterfactuals
por: Eiter, T, et al.
Publicado: (1992)

Complexity of propositional nested circumscription and nested abnormality theories
por: Cadoli, M, et al.
Publicado: (2005)

Achieving new upper bounds for the hypergraph duality problem through logic
por: Gottlob, G, et al.
Publicado: (2014)

Achieving new upper bounds for the hypergraph duality problem through logic
por: Gottlob, G, et al.
Publicado: (2018)

Propositional default logics made easier: computational complexity of model checking
por: Baumgartner, R, et al.
Publicado: (2002)

On the Complexity of Model Checking for Propositional Default Logics: New Results and Tractable Cases
por: Baumgartner, R, et al.
Publicado: (1999)

Reasoning with parsimonious and moderately grounded expansions
por: Eiter, T, et al.
Publicado: (1992)

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

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)

Identifying the Minimal Transversals of a Hypergraph and Related Problems
por: Eiter, T, et al.
Publicado: (1995)

Propositional Dynamic Logic of Looping and Converse
por: Streett, Robert S.
Publicado: (2023)

The Deducibility Problem in Propositional Dynamic Logic
por: Meyer, Albert R., et al.
Publicado: (2023)

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

A Logical Toolbox for Ontological Reasoning
por: Calì, A, et al.
Publicado: (2011)

Propositional and activity monitoring using qualitative spatial reasoning
por: Lane, Spencer Dale
Publicado: (2016)

Propositional and Activity Monitoring Using Qualitative Spatial Reasoning
por: Lane, Spencer Dale
Publicado: (2016)

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)

Propositional Dynamic Logics of Programs: A Survey
por: Parikh, Rohit
Publicado: (2023)

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

On the Indiscernibility of Individuals in Logic Programming
por: Eiter, T, et al.
Publicado: (1997)

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

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

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

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

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

Propositional reasoning about safety and termination of heap-manipulating programs
por: David, C, et al.
Publicado: (2015)

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

The Propositional Dynamic Logic of Deterministic, Well-Structured Programs
por: Halpern, Joseph Y., et al.
Publicado: (2023)

Using Propositional Logic for Requirements Verification of Service Workflow
por: Xu, L, et al.
Publicado: (2012)

A Completeness Result for a Propositional Dynamic Logic
por: Parikh, Rohit
Publicado: (2023)

Using Propositional Logic for Requirements Verification of Service Workflow
por: Xu, L, et al.
Publicado: (2012)

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

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