André Neumann
Computational Theory and Mathematics · 2007
A researcher in the Science corpus: 2 papers; trusts 5 researchers and is trusted by 0 researchers here, as inferred from the citation graph.
Subfields
- Computational Theory and Mathematics — 8 citations into it
- Artificial Intelligence — 7 citations into it
Whom André Neumann trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts André Neumann overall
Papers from André Neumann's perspective
Ordered by how strongly the researchers André Neumann trusts endorse each paper. Same corpus, a different order for every researcher.
- Chaff: engineering an efficient SAT solver (Proceedings - Design Automation Conference)
- Cha : Engineering an e cient SAT solver (Design Automation Conference)
- Towards a Theory of Declarative Knowledge
- The well-founded semantics for general logic programs
- ASSAT: computing answer sets of a logic program by SAT solvers (Artificial Intelligence)
- Extending and implementing the stable model semantics (Artificial Intelligence)
- The DLV system for knowledge representation and reasoning (TOCL)
- Constraint Processing (Encyclopedia of Artificial Intelligence)
- BerkMin: A fast and robust SAT-solver (Proceedings 2002 Design, Automation and Test in Europe Conference and Exhibition)
- An Extensible SAT-solver (International Conference on Theory and Applications of Satisfiability Testing)
Their papers
- clasp : A Conflict-Driven Answer Set Solver (2007) — 371 citations
- Conflict-Driven Answer Set Solving (2007) — 395 citations