Travelled to:1 × Italy
3 × USA
Collaborated with:∅ A.V.Gelder K.A.Ross J.V.Franco M.Kouril J.Ward S.Weaver M.Dransfield W.M.Vanfleet
Talks about:program (2) general (2) semant (2) logic (2) base (2) circumscript (1) uncomput (1) unfound (1) satisfi (1) express (1)
Person: John S. Schlipf
DBLP: Schlipf:John_S=
Contributed to:
2003
19901988
1986Wrote 4 papers:
- SAT-2003-FrancoKSWWDV #named #satisfiability
- SBSAT: a State-Based, BDD-Based Satisfiability Solver (JVF, MK, JSS, JW, SW, MD, WMV), pp. 398–410.
- PODS-1990-Schlipf #logic programming #semantics
- The Expressive Powers of the Logic Programming Semantics (JSS), pp. 196–204.
- PODS-1988-GelderRS #logic programming #semantics #set #source code
- Unfounded Sets and Well-Founded Semantics for General Logic Programs (AVG, KAR, JSS), pp. 221–230.
- LICS-1986-Schlipf #how #question
- How Uncomputable is General Circumscription? (JSS), pp. 92–95.