 | 2009 |
|---|
| 12 |       | Balázs Szörényi:
Characterizing Statistical Query Learning: Simplified Notions and Proofs.
ALT 2009: 186-200 |
| 2008 |
|---|
| 11 |  | Marina Langlois,
Robert H. Sloan,
Balázs Szörényi,
György Turán:
Horn Complements: Towards Horn-to-Horn Belief Revision.
AAAI 2008: 466-471 |
| 10 | | Robert H. Sloan,
Balázs Szörényi,
György Turán:
Projective DNF formulae and their revision.
Discrete Applied Mathematics 156(4): 530-544 (2008) |
| 9 | | Balázs Szörényi:
Disjoint DNF Tautologies with Conflict Bound Two.
JSAT 4(1): 1-14 (2008) |
| 8 | | Robert H. Sloan,
Balázs Szörényi,
György Turán:
On k-Term DNF with the Largest Number of Prime Implicants.
SIAM J. Discrete Math. 21(4): 987-998 (2008) |
| 2007 |
|---|
| 7 | | Robert H. Sloan,
Balázs Szörényi,
György Turán:
Revising threshold functions.
Theor. Comput. Sci. 382(3): 198-208 (2007) |
| 2005 |
|---|
| 6 | | Robert H. Sloan,
Balázs Szörényi,
György Turán:
On k-term DNF with largest number of prime implicants
Electronic Colloquium on Computational Complexity (ECCC)(023): (2005) |
| 2004 |
|---|
| 5 | | Judy Goldsmith,
Robert H. Sloan,
Balázs Szörényi,
György Turán:
New Revision Algorithms.
ALT 2004: 395-409 |
| 4 | | Judy Goldsmith,
Robert H. Sloan,
Balázs Szörényi,
György Turán:
Theory revision with queries: Horn, read-once, and parity formulas.
Artif. Intell. 156(2): 139-176 (2004) |
| 2003 |
|---|
| 3 | | Robert H. Sloan,
Balázs Szörényi,
György Turán:
Projective DNF Formulae and Their Revision.
COLT 2003: 625-639 |
| 2 | | Judy Goldsmith,
Robert H. Sloan,
Balázs Szörényi,
György Turán:
Theory Revision with Queries: Horn, Read-once, and Parity Formulas
Electronic Colloquium on Computational Complexity (ECCC)(039): (2003) |
| 2000 |
|---|
| 1 | | Judy Goldsmith,
Robert H. Sloan,
Balázs Szörényi,
György Turán:
Improved Algorithms for Theory Revision with Queries.
COLT 2000: 236-247 |
