The following pages link to Piero A. Bonatti (Q814595):
Displaying 46 items.
- (Q230819) (redirect page) (← links)
- Reasoning with infinite stable models (Q814596) (← links)
- On the undecidability of logics with converse, nominals, recursion and counting (Q814615) (← links)
- Query answering in circumscribed OWL2 profiles (Q825008) (← links)
- Autoepistemic logic programming (Q1344887) (← links)
- Querying disjunctive databases through nonmonotonic logics (Q1350535) (← links)
- Controlled query evaluation for known policies by combining lying and refusal (Q1424926) (← links)
- Secure agents (Q1861902) (← links)
- Optimizing the computation of overriding in \(\mathcal{DL}^{\mathsf{N}}\) (Q2082509) (← links)
- A false sense of security (Q2163880) (← links)
- Rational closure for all description logics (Q2321316) (← links)
- Controlled query evaluation with open queries for a decidable relational submodel (Q2385449) (← links)
- Erratum to: ``Reasoning with infinite stable models'' (Q2389687) (← links)
- On the logical properties of the nonmonotonic description logic \(\mathcal{DL}^{\operatorname{N}}\) (Q2407461) (← links)
- Lying versus refusal for known potential secrets (Q2734661) (← links)
- Auctions for Partial Heterogeneous Preferences (Q2849908) (← links)
- Towards a Mechanism for Incentivating Privacy (Q3100903) (← links)
- (Q3112648) (← links)
- The Complexity of Enriched Mu-Calculi (Q3535618) (← links)
- Answer Set Programming (Q3578395) (← links)
- A decidable subclass of finitary programs (Q3585163) (← links)
- The Complexity of Enriched μ-Calculi (Q3591423) (← links)
- Some Complexity Results on Fuzzy Description Logics (Q3593174) (← links)
- On Finitely Recursive Programs (Q3608648) (← links)
- On finitely recursive programs (Q3621269) (← links)
- The Complexity of Circumscription in DLs (Q3651476) (← links)
- (Q4218925) (← links)
- Autoepistemic logics as a unifying framework for the semantics of logic programs (Q4327843) (← links)
- (Q4472209) (← links)
- A sequent calculus for skeptical Default Logic (Q4610318) (← links)
- Sequent calculi for default and autoepistemic logics (Q4645232) (← links)
- (Q4708908) (← links)
- A Three-valued Formalization of Provability (Q4763534) (← links)
- (Q4800161) (← links)
- (Q4800167) (← links)
- (Q4812969) (← links)
- (Q4994897) (← links)
- Confidentiality Policies and Their Enforcement for Controlled Query Evaluation (Q5030177) (← links)
- Merging heterogeneous security orderings (Q5096413) (← links)
- Decidability of Circumscribed Description Logics Revisited (Q5172610) (← links)
- Nonmonotonic Description Logics – Requirements, Theory, and Implementations (Q5434473) (← links)
- Logic Programming (Q5475769) (← links)
- Composing Normal Programs with Function Symbols (Q5504671) (← links)
- Sequent calculi for propositional nonmonotonic logics (Q5738955) (← links)
- Foundations of Information and Knowledge Systems (Q5898537) (← links)
- Resolution for skeptical stable model semantics (Q5956119) (← links)
