EDBT 2026 Demo / reviewers in the wild / expert
Lengning Liu
dblp:72/1859
· DBLP profile ↗
10ranked-venue papers
9as first author
0since 2021 · last 2010
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 9 · 8 first-authorTheory of computation · 5 · 4 first-authorSoftware engineering, systems software and programming languages · 2 · 2 first-authorGraphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
3 papers |
Logic in computer science · 57% Automated reasoning and model checking · 15% Mathematical optimization · 15% | |
| Artificial intelligence
1 paper |
Knowledge representation and reasoning · 100% | |
| Software engineering, system software, and programming languages
1 paper |
Program analysis · 100% |
Topics — the 8 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Knowledge, reasoning and agents › Knowledge representation and reasoning
logic programming |
0.1 | 1 | 2010 | Logic programs with abstract constraint atoms: The role of computations · Artif. Intell. 2010 |
Logic in computer science › logic programming
answer set programming |
0.1 | 1 | 2010 | Logic programs with abstract constraint atoms: The role of computations · Artif. Intell. 2010 |
Logic in computer science
logic programming |
0.1 | 1 | 2010 | Logic programs with abstract constraint atoms: The role of computations · Artif. Intell. 2010 |
Mathematical optimization › combinatorial optimization
local search |
0.1 | 1 | 2006 | Local-Search Techniques for Boolean Combinations of Pseudo-Boolean Constraints · AAAI 2006 |
Automated reasoning and model checking › constraint solving
pseudo-boolean solving |
0.1 | 1 | 2006 | Local-Search Techniques for Boolean Combinations of Pseudo-Boolean Constraints · AAAI 2006 |
Program analysis › static analysis
constraint-based analysis |
0.1 | 1 | 2005 | Properties of Programs with Monotone and Convex Constraints · AAAI 2005 |
Computational complexity
constraint satisfaction |
0.1 | 1 | 2005 | Properties of Programs with Monotone and Convex Constraints · AAAI 2005 |
Logic in computer science
boolean combination |
0.0 | 1 | 2006 | Local-Search Techniques for Boolean Combinations of Pseudo-Boolean Constraints · AAAI 2006 |
Methods — techniques the papers use, named apart from their topics
stable model semantics · 0.2constraint reasoning · 0.1local search · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2010 | Logic programs with abstract constraint atoms: The role of computations
Lengning Liu, Enrico Pontelli, Tran Cao Son, Miroslaw Truszczynski |
Artif. Intell. | 1 |
| 2007 | Logic Programs with Abstract Constraint Atoms: The Role of Computations
Lengning Liu, Enrico Pontelli, Tran Cao Son, Miroslaw Truszczynski |
ICLP | 1 |
| 2007 | The First Answer Set Programming System Competition
Martin Gebser, Lengning Liu, Gayathri Namasivayam, André Neumann, Torsten Schaub, Miroslaw Truszczynski |
LPNMR | 2 |
| 2006 | Local-Search Techniques for Boolean Combinations of Pseudo-Boolean Constraints
Lengning Liu, Miroslaw Truszczynski |
AAAI | 1 |
| 2006 | Properties and Applications of Programs with Monotone and Convex ConstraintsabstractWe study properties of programs with monotone and convex constraints. We extend to these formalisms concepts and results from normal logic programming. They include the notions of strong and uniform equivalence with their characterizations, tight programs and Fages Lemma, program completion and loop formulas. Our results provide an abstract account of properties of some recent extensions of logic programming with aggregates, especially the formalism of lparse programs. They imply a method to compute stable models of lparse programs by means of off-the-shelf solvers of pseudo-boolean constraints, which is often much faster than the smodels system. Lengning Liu, Miroslaw Truszczynski |
J. Artif. Intell. Res. | 1 |
| 2005 | Properties of Programs with Monotone and Convex Constraints
Lengning Liu, Miroslaw Truszczynski |
AAAI | 1 |
| 2005 | Pbmodels - Software to Compute Stable Models by Pseudoboolean Solvers
Lengning Liu, Miroslaw Truszczynski |
LPNMR | 1 |
| 2004 | WSAT(CC) - A Fast Local-Search ASP Solver
Lengning Liu, Miroslaw Truszczynski |
LPNMR | 1 |
| 2004 | Local Search with Bootstrapping
Lengning Liu, Miroslaw Truszczynski |
SAT | 1 |
| 2003 | Local-Search Techniques for Propositional Logic Extended with Cardinality Constraints
Lengning Liu, Miroslaw Truszczynski |
CP | 1 |