BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Used together with:
logic (8)
program (6)
complex (3)
proposit (3)
minim (3)

Stem circumscript$ (all stems)

25 papers:

IJCARIJCAR-2014-BeyersdorffC #complexity #proving #theorem proving
The Complexity of Theorem Proving in Circumscription and Minimal Entailment (OB, LC), pp. 403–417.
ICLPICLP-2010-Wernhard10 #logic programming
Circumscription and Projection as Primitives of Logic Programming (CW), pp. 202–211.
KRKR-2008-DohertyS #reasoning #using
Reasoning with Qualitative Preferences and Cardinalities using Generalized Circumscription (PD, AS), pp. 560–570.
ICLPICLP-2007-OikarinenJ #linear #logic programming
A Linear Transformation from Prioritized Circumscription to Disjunctive Logic Programming (EO, TJ), pp. 440–441.
KRKR-2006-BonattiLW #logic
Description Logics with Circumscription (PAB, CL, FW), pp. 400–410.
KRKR-2004-McCarthy #reasoning
Historical Remarks on Nonmonotonic Reasoning, Especially Circumscription (JM0), pp. 738–739.
ICLPICLP-2004-WakakiI #compilation #programming #set
Compiling Prioritized Circumscription into Answer Set Programming (TW, KI), pp. 356–370.
LICSLICS-2004-NordhJ #algebra #approach #complexity
An Algebraic Approach to the Complexity of Propositional Circumscription (GN, PJ), pp. 367–376.
IJCARIJCAR-2001-Beeson #higher-order #proving #theorem proving
A Second-Order Theorem Prover Applied to Circumscription (MB), pp. 318–324.
LICSLICS-2001-KirousisK #complexity
A Dichotomy in the Complexity of Propositional Circumscription (LMK, PGK), pp. 71–80.
ICLPCL-2000-MoinardR #finite #set
Smallest Equivalent Sets for Finite Propositional Formula Circumscription (YM, RR), pp. 897–911.
KRKR-1998-Amir #revisited
Pointwise Circumscription Revisited (EA), pp. 202–211.
CSLCSL-1997-BonattiO #calculus
A Sequent Calculus for Circumscription (PAB, NO), pp. 98–114.
KRKR-1996-BaralGP
Value Minimization in Circumscription (CB, AG, AP), pp. 474–481.
ICLPICLP-1995-WakakiS #logic programming
Computing Prioritized Circumscription by Logic Programming (TW, KS), pp. 283–297.
KRKR-1994-MoinardR
Preferential Entailments for Circumscriptions (YM, RR), pp. 461–472.
CADECADE-1994-Iwanuma #normalisation #parallel #query
Conservative Query Normalization on Parallel Circumscription (KI), pp. 296–310.
CSLCSL-1990-Jaspars #information management
A Generalization of Stability and its Application to Circumscription of Positive Introspective Knowledge (JJ), pp. 289–299.
KRKR-1989-Lifschitz #logic
Between Circumscription and Autoepistemic Logic (VL), pp. 235–244.
ICLPNACLP-1989-YouL #logic programming
Supported Circumscription and Its Relation to Logic Programming with Negation (JHY, LL), pp. 291–309.
ICLPJICSCP-1988-Moinard88
Pointwise Circumscription is Equivalent to Predicate Completion (Sometimes) (YM), pp. 1097–1105.
LICSLICS-1987-BidoitF #logic programming
Minimalism subsumes Default Logic and Circumscription in Stratified Logic Programming (NB, CF), pp. 89–97.
PODSPODS-1986-GelfondPP #parallel
The Extended Closed World Assumpution and its Relationship to Parallel Circumscription (MG, HP, TCP), pp. 133–139.
LICSLICS-1986-Schlipf #how
How Uncomputable is General Circumscription? (Extended Abstract) (JSS), pp. 92–95.
CADECADE-1984-MinkerP
Applications of Protected Circumscription (JM, DP), pp. 414–425.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.