Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
126 | Toshiko Wakaki, Katsumi Inoue |
Compiling Prioritized Circumscription into Answer Set Programming. |
ICLP |
2004 |
DBLP DOI BibTeX RDF |
|
114 | Zuoquan Lin |
Paraconsistent Circumscription: First-Order Case. |
ISMVL |
1995 |
DBLP DOI BibTeX RDF |
paraconsistent circumscription, predicate circumscription, minimal semantics, nonmonotonic reasoning, formal logic, paraconsistent logic, nonmonotonic logic, classical logic |
111 | Gustav Nordh, Peter Jonsson |
An Algebraic Approach to the Complexity of Propositional Circumscription. |
LICS |
2004 |
DBLP DOI BibTeX RDF |
|
111 | Yves Moinard, Raymond Rolland |
Smallest Equivalent Sets for Finite Propositional Formula Circumscription. |
Computational Logic |
2000 |
DBLP DOI BibTeX RDF |
|
111 | Jianhua Chen 0003 |
Embedding Prioritized Circumscription in Logic Programs. |
ISMIS |
1997 |
DBLP DOI BibTeX RDF |
|
105 | Emilia Oikarinen, Tomi Janhunen |
Implementing Prioritized Circumscription by Computing Disjunctive Stable Models. |
AIMSA |
2008 |
DBLP DOI BibTeX RDF |
Prioritized circumscription, disjunctive stable models, answer set programming, linear transformation |
105 | Marco Cadoli, Thomas Eiter, Georg Gottlob |
Complexity of propositional nested circumscription and nested abnormality theories. |
ACM Trans. Comput. Log. |
2005 |
DBLP DOI BibTeX RDF |
Horn theories, nested abnormality theories, computational complexity, nonmonotonic reasoning, knowledge representation and reasoning, Circumscription |
105 | Phokion G. Kolaitis, Christos H. Papadimitriou |
Some Computational Aspects of Circumscription |
J. ACM |
1990 |
DBLP DOI BibTeX RDF |
Horn, Model checking, NP-completeness, first-order logic, nonmonotonic reasoning, undecidability, Circumscription |
96 | Uwe Egly, Hans Tompits |
On Proof Complexity of Circumscription. |
TABLEAUX |
1998 |
DBLP DOI BibTeX RDF |
|
90 | Peter K. Rathmann, Marianne Winslett, Mark S. Manasse |
Circumscription with Homomorphisms: Solving the Equality and Counterexample Problems. |
J. ACM |
1994 |
DBLP DOI BibTeX RDF |
common sense reasoning, circumscription |
81 | Emilia Oikarinen, Tomi Janhunen |
A Linear Transformation from Prioritized Circumscription to Disjunctive Logic Programming. |
ICLP |
2007 |
DBLP DOI BibTeX RDF |
|
76 | Lefteris M. Kirousis, Phokion G. Kolaitis |
On the Complexity of Model Checking and Inference in Minimal Models. |
LPNMR |
2001 |
DBLP DOI BibTeX RDF |
|
66 | Lefteris M. Kirousis, Phokion G. Kolaitis |
A Dichotomy in the Complexity of Propositional Circumscription. |
Theory Comput. Syst. |
2004 |
DBLP DOI BibTeX RDF |
|
66 | Gustav Nordh |
A Trichotomy in the Complexity of Propositional Circumscription. |
LPAR |
2004 |
DBLP DOI BibTeX RDF |
|
66 | Li-Yan Yuan, Jia-Huai You |
Discriminant Circumscription. |
FSTTCS |
1990 |
DBLP DOI BibTeX RDF |
Logic Programming with Negation, Deductive Databases, Nonmonotonic Reasoning |
66 | Atsushi Togashi, Ben-Hui Hou, Shoichi Noguchi |
Believability in Default Logic Entails Logical Consequence from Circumscription (Somestimes). |
KBCS |
1989 |
DBLP DOI BibTeX RDF |
|
61 | Atsushi Togashi, Ben-Hui Hou, Shoichi Noguchi |
Generalized Predicate Completion. |
KBCS |
1989 |
DBLP DOI BibTeX RDF |
|
61 | Gerhard Jäger |
Some Contributions to the Logical Analysis of Circumscrition. |
CADE |
1986 |
DBLP DOI BibTeX RDF |
|
51 | Emilia Oikarinen, Tomi Janhunen |
circ2dlp - Translating Circumscription into Disjunctive Logic Programming. |
LPNMR |
2005 |
DBLP DOI BibTeX RDF |
|
51 | Tomi Janhunen, Emilia Oikarinen |
Capturing Parallel Circumscription with Disjunctive Logic Programs. |
JELIA |
2004 |
DBLP DOI BibTeX RDF |
|
51 | Ken Satoh |
Formalizing Retrieval Goal Change by Prioritized Circumscription - Preliminary Report. |
CIA |
2003 |
DBLP DOI BibTeX RDF |
|
51 | Michael Beeson |
A Second-Order Theorem Prover Applied to Circumscription. |
IJCAR |
2001 |
DBLP DOI BibTeX RDF |
|
51 | Koji Iwanuma |
Conservative Query Normalization on Parallel Circumscription. |
CADE |
1994 |
DBLP DOI BibTeX RDF |
|
51 | Jack Minker, Donald Perlis |
Applications of Protected Circumscription. |
CADE |
1984 |
DBLP DOI BibTeX RDF |
|
45 | Yves Moinard, Raymond Rolland |
Around a Powerful Property of Circumscriptions. |
JELIA |
1994 |
DBLP DOI BibTeX RDF |
|
41 | Gaby Merziger, Mathias Bauer |
Conditioned Circumscription: Translating Defaults to Circumscription. |
GWAI |
1990 |
DBLP DOI BibTeX RDF |
|
39 | Piero A. Bonatti, Nicola Olivetti |
Sequent calculi for propositional nonmonotonic logics. |
ACM Trans. Comput. Log. |
2002 |
DBLP DOI BibTeX RDF |
Default Logic, Circumscription, Sequent calculi, Autoepistemic Logic, Rejection methods |
39 | Georg Gottlob, Francesco Scarcello, Martha Sideri |
Fixed-Parameter Complexity in AI and Nonmonotonic Reasoning. |
LPNMR |
1999 |
DBLP DOI BibTeX RDF |
Complexity, Logic Programming, Constraint Satisfaction, Nonmonotonic Reasoning, Fixed-parameter Tractability, Stable Models, Prime Implicants, Circumscription |
39 | Phan Minh Dung |
On the strong completion of logic programs. |
ALP |
1990 |
DBLP DOI BibTeX RDF |
predicate completion, two-valued logic, Logic programming, negation, three-valued logic, stable models, circumscription, well-founded models |
36 | Fangkai Yang, Xiaoping Chen |
Integrating Rules and Description Logics with Circumscription for the Semantic Web. |
RuleML |
2007 |
DBLP DOI BibTeX RDF |
|
36 | Katsumi Inoue, Haruka Saito |
Circumscription Policies for Induction. |
ILP |
2004 |
DBLP DOI BibTeX RDF |
|
36 | Arnaud Durand 0001, Miki Hermann |
The Inference Problem for Propositional Circumscription of Affine Formulas Is coNP-Complete. |
STACS |
2003 |
DBLP DOI BibTeX RDF |
|
36 | Piero A. Bonatti, Nicola Olivetti |
A Sequent Calculus for Circumscription. |
CSL |
1997 |
DBLP DOI BibTeX RDF |
|
36 | Marco Cadoli, Francesco M. Donini, Marco Schaerf |
On Compact Representations of Propositional Circumscription. |
STACS |
1995 |
DBLP DOI BibTeX RDF |
|
36 | Li-Yan Yuan, Jia-Huai You |
Knowledge Base Revision Using Circumscription. |
DOOD |
1993 |
DBLP DOI BibTeX RDF |
|
30 | Michael Thomas 0001 |
The Complexity of Circumscriptive Inference in Post's Lattice. |
LPNMR |
2009 |
DBLP DOI BibTeX RDF |
|
30 | Thomas Eiter, Georg Gottlob |
On the Complexity of Theory Curbing. |
LPAR |
2000 |
DBLP DOI BibTeX RDF |
|
30 | Patrick Doherty 0001, Witold Lukaszewicz, Andrzej Szalas |
Efficient Reasoning Using the Local Closed-World Assumption. |
AIMSA |
2000 |
DBLP DOI BibTeX RDF |
|
30 | Piero A. Bonatti, Thomas Eiter |
Querying Disjunctive Database Through Nonmonotonic Logics. |
ICDT |
1995 |
DBLP DOI BibTeX RDF |
|
30 | Patrick Doherty 0001, Witold Lukaszewicz |
Circumscribing Features and Fluents: A Fluent Logic for Reasoning about Action and Change. |
ISMIS |
1994 |
DBLP DOI BibTeX RDF |
|
30 | Leopoldo E. Bertossi, Raymond Reiter |
On the Concept of Generic Object: A Nonmonotonic Reasoning Approach and Examples. |
JELIA |
1994 |
DBLP DOI BibTeX RDF |
|
24 | Georgios K. Giannikis, Aspassia Daskalopulu |
The Representation of e-Contracts as Default Theories. |
IEA/AIE |
2007 |
DBLP DOI BibTeX RDF |
Reasoning with incomplete knowledge, Multi-agent systems, E-commerce, Default Logic, Event Calculus, Default reasoning, Circumscription |
24 | Robert van Rooij, Katrin Schulz |
Exhaustive Interpretation of Complex Sentences. |
J. Log. Lang. Inf. |
2004 |
DBLP DOI BibTeX RDF |
conversational implicatures, exhaustive interpretation, pragmatics, non-monotonic reasoning, Circumscription |
24 | Uwe Egly, Hans Tompits |
Proof-complexity results for nonmonotonic reasoning. |
ACM Trans. Comput. Log. |
2001 |
DBLP DOI BibTeX RDF |
default logic, circumscription, sequent calculi |
24 | Christos H. Papadimitriou |
On Selecting a Satisfying Truth Assignment (Extended Abstract) |
FOCS |
1991 |
DBLP DOI BibTeX RDF |
2SAT, satisfying truth assignment selection, natural generalizations, default preference, polynomial-time randomized algorithm, complexity, satisfiability, minimality, circumscription, selection criteria |
21 | Piero A. Bonatti, Federica Di Stefano 0001, Magdalena Ortiz 0001, Mantas Simkus |
Circumscription in DL-Lite: Progress Report. |
Description Logics |
2023 |
DBLP BibTeX RDF |
|
21 | Federica Di Stefano 0001, Magdalena Ortiz 0001, Mantas Simkus |
Description Logics with Pointwise Circumscription. |
IJCAI |
2023 |
DBLP DOI BibTeX RDF |
|
21 | Federica Di Stefano 0001, Magdalena Ortiz 0001, Mantas Simkus |
Pointwise Circumscription in Description Logics. |
Description Logics |
2022 |
DBLP BibTeX RDF |
|
21 | Mario Alviano |
Argumentation Reasoning via Circumscription with Pyglaf. |
Fundam. Informaticae |
2019 |
DBLP DOI BibTeX RDF |
|
21 | Mario Alviano |
Query Answering in Propositional Circumscription. |
IJCAI |
2018 |
DBLP DOI BibTeX RDF |
|
21 | Mario Alviano |
Model enumeration in propositional circumscription via unsatisfiable core analysis. |
CoRR |
2017 |
DBLP BibTeX RDF |
|
21 | Mario Alviano |
Model enumeration in propositional circumscription via unsatisfiable core analysis. |
Theory Pract. Log. Program. |
2017 |
DBLP DOI BibTeX RDF |
|
21 | Mallika R. Robinson, Ahmed Imran, Michael Barlow |
Practice of Design Science Research in a Developing Country: Circumscription Knowledge Informed by the Socio-cultural Context. |
ACIS |
2017 |
DBLP BibTeX RDF |
|
21 | Mario Alviano |
Ingredients of the Argumentation Reasoner pyglaf: Python, Circumscription, and Glucose to Taste. |
RCRA@AI*IA |
2017 |
DBLP BibTeX RDF |
|
21 | Michael Richter, Ramon Rosselló-Mora, Frank Oliver Glöckner, Jörg Peplies |
JSpeciesWS: a web server for prokaryotic species circumscription based on pairwise genome comparison. |
Bioinform. |
2016 |
DBLP DOI BibTeX RDF |
|
21 | Stathis Delivorias, Sebastian Rudolph |
Revisiting Grounded Circumscription in Description Logics. |
RR |
2016 |
DBLP DOI BibTeX RDF |
|
21 | Arjun Bhardwaj |
Extending SROIQ with Constraint Networks and Grounded Circumscription. |
CoRR |
2015 |
DBLP BibTeX RDF |
|
21 | Yisong Wang, Kewen Wang 0001, Zhe Wang 0001, Zhiqiang Zhuang |
Knowledge Forgetting in Circumscription: A Preliminary Report. |
AAAI |
2015 |
DBLP DOI BibTeX RDF |
|
21 | Olaf Beyersdorff, Leroy Chew |
The Complexity of Theorem Proving in Circumscription and Minimal Entailment. |
Electron. Colloquium Comput. Complex. |
2014 |
DBLP BibTeX RDF |
|
21 | |
GC-SROIQ(C) : Expressive Constraint Modelling and Grounded Circumscription for SROIQ. |
CoRR |
2014 |
DBLP BibTeX RDF |
|
21 | Piero A. Bonatti, Carsten Lutz, Frank Wolter |
The Complexity of Circumscription in DLs. |
CoRR |
2014 |
DBLP BibTeX RDF |
|
21 | Hai Wan, Zhanhao Xiao, Zhenfeng Yuan, Heng Zhang 0006, Yan Zhang 0003 |
Computing General First-Order Parallel and Prioritized Circumscription. |
AAAI |
2014 |
DBLP DOI BibTeX RDF |
|
21 | Olaf Beyersdorff, Leroy Chew |
The Complexity of Theorem Proving in Circumscription and Minimal Entailment. |
IJCAR |
2014 |
DBLP DOI BibTeX RDF |
|
21 | Dantong Ouyang, Xianji Cui, Yuxin Ye |
Integrity constraints in OWL ontologies based on grounded circumscription. |
Frontiers Comput. Sci. |
2013 |
DBLP DOI BibTeX RDF |
|
21 | Vernon Asuncion, Yan Zhang 0003, Heng Zhang 0006, Yi Zhou 0013 |
Constructive Circumscription. |
Theory Pract. Log. Program. |
2013 |
DBLP BibTeX RDF |
|
21 | Christoph Wernhard |
Projection and scope-determined circumscription. |
J. Symb. Comput. |
2012 |
DBLP DOI BibTeX RDF |
|
21 | Neelakantan Kartha |
Lifschitz and Circumscription. |
Correct Reasoning |
2012 |
DBLP DOI BibTeX RDF |
|
21 | Paolo Ferraris, Joohyung Lee 0002, Vladimir Lifschitz |
Stable models and circumscription. |
Artif. Intell. |
2011 |
DBLP DOI BibTeX RDF |
|
21 | Fangzhen Lin, Yi Zhou 0013 |
From answer set logic programming to circumscription via logic of GK. |
Artif. Intell. |
2011 |
DBLP DOI BibTeX RDF |
|
21 | Kunal Sengupta, Adila Alfa Krisnadhi, Pascal Hitzler |
Local Closed World Semantics: Grounded Circumscription for OWL. |
ISWC (1) |
2011 |
DBLP DOI BibTeX RDF |
|
21 | Mikolás Janota, João Marques-Silva 0001 |
cmMUS: A Tool for Circumscription-Based MUS Membership Testing. |
LPNMR |
2011 |
DBLP DOI BibTeX RDF |
|
21 | Qian Yang, Jia-Huai You, Zhiyong Feng 0002 |
Integrating Rules and Description Logics by Circumscription. |
AAAI |
2011 |
DBLP DOI BibTeX RDF |
|
21 | Michael Bartholomew, Joohyung Lee 0002, Yunsong Meng |
First-Order Semantics of Aggregates in Answer Set Programming Via Modified Circumscription. |
AAAI Spring Symposium: Logical Formalizations of Commonsense Reasoning |
2011 |
DBLP BibTeX RDF |
|
21 | Michael Bartholomew, Joohyung Lee 0002, Yunsong Meng |
First-Order Extension of the FLP Stable Model Semantics via Modified Circumscription. |
IJCAI |
2011 |
DBLP DOI BibTeX RDF |
|
21 | Adila Alfa Krisnadhi, Kunal Sengupta, Pascal Hitzler |
Local Closed World Semantics: Grounded Circumscription for Description Logics. |
RR |
2011 |
DBLP DOI BibTeX RDF |
|
21 | Mikolás Janota, João Marques-Silva 0001, Radu Grigore |
Counterexample Guided Abstraction Refinement Algorithm for Propositional Circumscription |
CoRR |
2010 |
DBLP BibTeX RDF |
|
21 | Christoph Wernhard |
Circumscription and Projection as Primitives of Logic Programming. |
ICLP (Technical Communications) |
2010 |
DBLP DOI BibTeX RDF |
|
21 | Heng Zhang 0006, Mingsheng Ying |
Decidable Fragments of First-Order Language Under Stable Model Semantics and Circumscription. |
AAAI |
2010 |
DBLP DOI BibTeX RDF |
|
21 | Mikolás Janota, Radu Grigore, João Marques-Silva 0001 |
Counterexample Guided Abstraction Refinement Algorithm for Propositional Circumscription. |
JELIA |
2010 |
DBLP DOI BibTeX RDF |
|
21 | Piero A. Bonatti, Carsten Lutz, Frank Wolter |
The Complexity of Circumscription in DLs. |
J. Artif. Intell. Res. |
2009 |
DBLP DOI BibTeX RDF |
|
21 | Koji Iwanuma, Katsumi Inoue, Hidetomo Nabeshima |
Reconsideration of circumscriptive induction with pointwise circumscription. |
J. Appl. Log. |
2009 |
DBLP DOI BibTeX RDF |
|
21 | Christoph Wernhard |
Literal Projection and Circumscription. |
FTP |
2009 |
DBLP BibTeX RDF |
|
21 | Arnaud Durand 0001, Miki Hermann |
On the counting complexity of propositional circumscription. |
Inf. Process. Lett. |
2008 |
DBLP DOI BibTeX RDF |
|
21 | Patrick Doherty 0001, Andrzej Szalas |
Reasoning with Qualitative Preferences and Cardinalities using Generalized Circumscription. |
KR |
2008 |
DBLP BibTeX RDF |
|
21 | Fangkai Yang, Xiaoping Chen |
DL_clog: A Hybrid System Integrating Rules and Description Logics with Circumscription. |
Description Logics |
2007 |
DBLP BibTeX RDF |
|
21 | Fangzhen Lin, Yi Zhou 0013 |
From Answer Set Logic Programming to Circumscription via Logic of GK. |
IJCAI |
2007 |
DBLP BibTeX RDF |
|
21 | Joohyung Lee 0002, Fangzhen Lin |
Loop formulas for circumscription. |
Artif. Intell. |
2006 |
DBLP DOI BibTeX RDF |
|
21 | Piero A. Bonatti, Carsten Lutz, Frank Wolter |
Description Logics with Circumscription. |
KR |
2006 |
DBLP BibTeX RDF |
|
21 | Joohyung Lee 0002, Fangzhen Lin |
Loop Formulas for Circumscription. |
AAAI |
2004 |
DBLP BibTeX RDF |
|
21 | John McCarthy 0001 |
Historical Remarks on Nonmonotonic Reasoning, Especially Circumscription. |
KR |
2004 |
DBLP BibTeX RDF |
|
21 | Hubie Chen |
Inverse Circumscription. |
IJCAI |
2003 |
DBLP BibTeX RDF |
|
21 | Marco Cadoli, Thomas Eiter, Georg Gottlob |
Complexity of Nested Circumscription and Nested Abnormality Theories |
CoRR |
2002 |
DBLP BibTeX RDF |
|
21 | Graham White 0001 |
Intensionality and circumscription. |
NMR |
2002 |
DBLP BibTeX RDF |
|
21 | Sylvie Coste-Marquis, Pierre Marquis |
Knowledge Compilation for Closed World Reasoning and Circumscription. |
J. Log. Comput. |
2001 |
DBLP DOI BibTeX RDF |
|
21 | Lefteris M. Kirousis, Phokion G. Kolaitis |
A Dichotomy in the Complexity of Propositional Circumscription. |
LICS |
2001 |
DBLP DOI BibTeX RDF |
|
21 | Marco Cadoli, Thomas Eiter, Georg Gottlob |
Complexity of Nested Circumscription and Abnormality Theories. |
IJCAI |
2001 |
DBLP BibTeX RDF |
|
21 | Yves Moinard |
Note about cardinality-based circumscription. |
Artif. Intell. |
2000 |
DBLP DOI BibTeX RDF |
|
21 | Alexei Lisitsa 0001 |
Generalized vs formula circumscription over finite models. |
AI&M |
2000 |
DBLP BibTeX RDF |
|
21 | Jianhua Chen 0003 |
Embedding prioritized circumscription in disjunctive logic programs. |
J. Exp. Theor. Artif. Intell. |
1999 |
DBLP DOI BibTeX RDF |
|
21 | Sylvie Coste-Marquis, Pierre Marquis |
Complexity Results for Propositional Closed World Reasoning and Circumscription from Tractable Knowledge Bases. |
IJCAI |
1999 |
DBLP BibTeX RDF |
|