cs-conference-ranking.org Search 971 venues

John S. Schlipf

Publication record assembled from the DBLP archive of ranked conferences.

Papers indexed

11

Venues

7

Active years

1986–2008

Best venue rank

A*

Where they publish

Papers

11 indexed papers, newest first.

Year	Venue	Title	Authors
2008	ISAIM	Complexity of First Order ID-Logic.	John S. Schlipf, Marc Denecker
2004	LPNMR	Answer Set Programming with Clause Learning.	Jeffrey Ward, John S. Schlipf
2003	SAT	SBSAT: a State-Based, BDD-Based Satisfiability Solver.	John V. Franco, Michal Kouril, John S. Schlipf, Jeffrey Ward, Sean A. Weaver, Michael R. Dransfield, W. Mark Vanfleet
1997	LPNMR	Affordable Classes of Normal Logic Programs.	J. Seitzer, John S. Schlipf
1995	LPNMR	Computing Well-founded Semantics Faster.	Kenneth A. Berman, John S. Schlipf, John V. Franco
1992	ICLP	A Survey of Complexity and Undecidability Results in Logic Programming.	John S. Schlipf
1991	LPNMR	Representing Epistemic Intervals in Logic Programs.	John S. Schlipf
1990	PODS	The Expressive Powers of the Logic Programming Semantics.	John S. Schlipf
1988	ISMIS	When is Closed World Reasoning Tractable?	John S. Schlipf
1988	PODS	Unfounded Sets and Well-Founded Semantics for General Logic Programs.	Allen Van Gelder, Kenneth A. Ross, John S. Schlipf
1986	LICS	How Uncomputable is General Circumscription? (Extended Abstract)	John S. Schlipf