projector an automatic logic program rewriting tool for

PROJECTOR: an automatic logic program rewriting tool for better - PowerPoint PPT Presentation

PROJECTOR: an automatic logic program rewriting tool for better performance Nick Hippen & Yuliya Lierler Nick Hippen University of Nebraska at Omaha What is Answer Set Programming (ASP)? Constraint programming paradigm geared towards


  1. PROJECTOR: an automatic logic program rewriting tool for better performance Nick Hippen & Yuliya Lierler Nick Hippen University of Nebraska at Omaha

  2. What is Answer Set Programming (ASP)? β€’ Constraint programming paradigm geared towards solving difficult combinatorial search problems β€’ Prolog-like syntax Logic Rule Meaning π‘‘β„Žπ‘—π‘šπ‘’ π‘Œ, 𝑍 ← π‘žπ‘π‘ π‘“π‘œπ‘’ 𝑍, π‘Œ . X is a child of Y if Y is a parent of X. π‘—π‘œπ‘œπ‘π‘‘π‘“π‘œπ‘’ π‘Œ ← π‘œπ‘π‘’ π‘•π‘£π‘—π‘šπ‘’π‘§ π‘Œ . X is innocent if I have no reason to believe that X is guilty Head ← Body Nick Hippen University of Nebraska at Omaha 2

  3. ASP Solver Architecture logic grounded answer Grounder ASP Solver program program sets logic rewritten logic grounded answer Grounder ASP Solver PROJECTOR program program program sets Nick Hippen University of Nebraska at Omaha 3

  4. Grounding Logic Programs Logic Program Grounded Program Intelligently Grounded Program π‘žπ‘π‘ π‘“π‘œπ‘’ 𝑐𝑝𝑐, π‘π‘šπ‘šπ‘§ . π‘žπ‘π‘ π‘“π‘œπ‘’ 𝑐𝑝𝑐, π‘π‘šπ‘šπ‘§ . π‘žπ‘π‘ π‘“π‘œπ‘’ 𝑐𝑝𝑐, π‘π‘šπ‘šπ‘§ . π‘žπ‘π‘ π‘“π‘œπ‘’ 𝑛𝑏𝑠𝑠𝑧, π‘˜π‘β„Žπ‘œ . π‘žπ‘π‘ π‘“π‘œπ‘’ 𝑛𝑏𝑠𝑠𝑧, π‘˜π‘β„Žπ‘œ . π‘žπ‘π‘ π‘“π‘œπ‘’ 𝑛𝑏𝑠𝑠𝑧, π‘˜π‘β„Žπ‘œ . π‘‘π‘—π‘π‘šπ‘—π‘œπ‘• 𝑐𝑝𝑐, 𝑛𝑏𝑠𝑠𝑧 . π‘‘π‘—π‘π‘šπ‘—π‘œπ‘• 𝑐𝑝𝑐, 𝑛𝑏𝑠𝑠𝑧 . π‘‘π‘—π‘π‘šπ‘—π‘œπ‘• 𝑐𝑝𝑐, 𝑛𝑏𝑠𝑠𝑧 . π‘‘π‘π‘£π‘‘π‘—π‘œ π‘Œ, 𝑍 ← π‘žπ‘π‘ π‘“π‘œπ‘’ 𝑄1, π‘Œ , π‘‘π‘π‘£π‘‘π‘—π‘œ π‘˜π‘β„Žπ‘œ, 𝑛𝑏𝑠𝑠𝑧 ← π‘žπ‘π‘ π‘“π‘œπ‘’ π‘π‘šπ‘šπ‘§, π‘˜π‘β„Žπ‘œ , π‘‘π‘π‘£π‘‘π‘—π‘œ π‘π‘šπ‘šπ‘§, π‘˜π‘β„Žπ‘œ ← π‘žπ‘π‘ π‘“π‘œπ‘’ 𝑐𝑝𝑐, π‘π‘šπ‘šπ‘§ , π‘žπ‘π‘ π‘“π‘œπ‘’ 𝑄2, 𝑍 , π‘žπ‘π‘ π‘“π‘œπ‘’ 𝑐𝑝𝑐, 𝑛𝑏𝑠𝑠𝑧 , π‘žπ‘π‘ π‘“π‘œπ‘’ 𝑛𝑏𝑠𝑠𝑧, π‘˜π‘β„Žπ‘œ , π‘‘π‘—π‘π‘šπ‘—π‘œπ‘• 𝑄1, 𝑄2 , π‘‘π‘—π‘π‘šπ‘—π‘œπ‘• π‘π‘šπ‘šπ‘§, 𝑐𝑝𝑐 , π‘‘π‘—π‘π‘šπ‘—π‘œπ‘• 𝑐𝑝𝑐, 𝑛𝑏𝑠𝑠𝑧 , π‘Œ β‰  𝑍. π‘˜π‘β„Žπ‘œ β‰  𝑛𝑏𝑠𝑠𝑧. π‘π‘šπ‘šπ‘§ β‰  π‘˜π‘β„Žπ‘œ. … π‘‘π‘π‘£π‘‘π‘—π‘œ 𝑐𝑝𝑐, 𝑐𝑝𝑐 ← π‘žπ‘π‘ π‘“π‘œπ‘’ 𝑐𝑝𝑐, 𝑐𝑝𝑐 , π‘žπ‘π‘ π‘“π‘œπ‘’ 𝑐𝑝𝑐, 𝑐𝑝𝑐 , π‘‘π‘—π‘π‘šπ‘—π‘œπ‘• 𝑐𝑝𝑐, 𝑐𝑝𝑐 , 𝑐𝑝𝑐 β‰  𝑐𝑝𝑐. … Nick Hippen University of Nebraska at Omaha 4

  5. Improving Performance Smaller grounding sizes often translate into faster solve times Idea: Split a logic rule into multiple rules so that the number of variables present in each new rule is smaller than that of the original. Projection Two types: 𝛽 and 𝛾 Nick Hippen University of Nebraska at Omaha 5

  6. PROJECTOR Result: 𝛽 Logic Program PROJECTOR: 𝜷 -projection π‘‘π‘π‘£π‘‘π‘—π‘œ π‘Œ, 𝑍 ← π‘žπ‘π‘ π‘“π‘œπ‘’ 𝑄1, π‘Œ , π‘ž0 𝑍, 𝑄1 ← π‘‘π‘—π‘π‘šπ‘—π‘œπ‘• 𝑄1, 𝑄2 , π‘žπ‘π‘ π‘“π‘œπ‘’ 𝑄2, 𝑍 . π‘žπ‘π‘ π‘“π‘œπ‘’ 𝑄2, 𝑍 , π‘ž1 𝑍, π‘Œ ← π‘žπ‘π‘ π‘“π‘œπ‘’ 𝑄1, π‘Œ , π‘ž0 𝑍, 𝑄1 . π‘‘π‘—π‘π‘šπ‘—π‘œπ‘• 𝑄1, 𝑄2 , π‘‘π‘π‘£π‘‘π‘—π‘œ π‘Œ, 𝑍 ← π‘Œ β‰  𝑍, π‘ž1 𝑍, π‘Œ . π‘Œ β‰  𝑍. Nick Hippen University of Nebraska at Omaha 6

  7. Nondeterministic behavior Logic Program PROJECTOR: 𝜷 -projection Scenario #1 PROJECTOR: 𝜷 -projection Scenario #2 π‘‘π‘π‘£π‘‘π‘—π‘œ π‘Œ, 𝑍 ← π‘žπ‘π‘ π‘“π‘œπ‘’ 𝑄1, π‘Œ , π‘ž0 𝑍, 𝑄1 ← π‘‘π‘—π‘π‘šπ‘—π‘œπ‘• 𝑄1, 𝑄2 , π‘žπ‘π‘ π‘“π‘œπ‘’ 𝑄2, 𝑍 . π‘ž0 𝑄2, π‘Œ ← π‘‘π‘—π‘π‘šπ‘—π‘œπ‘• 𝑄1, 𝑄2 , π‘žπ‘π‘ π‘“π‘œπ‘’ 𝑄1, π‘Œ . π‘žπ‘π‘ π‘“π‘œπ‘’ 𝑄2, 𝑍 , π‘ž1 𝑍, π‘Œ ← π‘žπ‘π‘ π‘“π‘œπ‘’ 𝑄1, π‘Œ , π‘ž0 𝑍, 𝑄1 . π‘ž1 𝑍, π‘Œ ← π‘žπ‘π‘ π‘“π‘œπ‘’ 𝑄2, 𝑍 , π‘ž0 𝑄2, π‘Œ . π‘‘π‘—π‘π‘šπ‘—π‘œπ‘• 𝑄1, 𝑄2 , π‘‘π‘π‘£π‘‘π‘—π‘œ π‘Œ, 𝑍 ← π‘Œ β‰  𝑍, π‘ž1 𝑍, π‘Œ . π‘‘π‘π‘£π‘‘π‘—π‘œ π‘Œ, 𝑍 ← π‘Œ β‰  𝑍, π‘ž1 𝑍, π‘Œ . π‘Œ β‰  𝑍. Nick Hippen University of Nebraska at Omaha 7

  8. PROJECTOR Result: 𝛾 Logic Program PROJECTOR: 𝜷 -projection PROJECTOR: 𝜸 -projection π‘›π‘π‘šπ‘“ ↓ π‘‘π‘π‘£π‘‘π‘—π‘œ π‘Œ, 𝑍 ← π‘žπ‘π‘ π‘“π‘œπ‘’ 𝑄1, π‘Œ , π‘ž0 𝑍, 𝑄1 ← π‘‘π‘—π‘π‘šπ‘—π‘œπ‘• 𝑄1, 𝑄2 , π‘žπ‘π‘ π‘“π‘œπ‘’ 𝑄2, 𝑍 . π‘ž0 𝑍, 𝑄1 ← π‘‘π‘—π‘π‘šπ‘—π‘œπ‘• 𝑄1, 𝑄2 , π‘žπ‘π‘ π‘“π‘œπ‘’ 𝑄2, 𝑍 . π‘žπ‘π‘ π‘“π‘œπ‘’ 𝑄2, 𝑍 , π‘ž1 𝑍, π‘Œ ← π‘žπ‘π‘ π‘“π‘œπ‘’ 𝑄1, π‘Œ , π‘ž0 𝑍, 𝑄1 . π‘ž1 𝑍, π‘Œ ← π‘žπ‘π‘ π‘“π‘œπ‘’ 𝑄1, π‘Œ , π‘ž0 𝑍, 𝑄1 , π‘›π‘π‘šπ‘“(π‘Œ). π‘‘π‘—π‘π‘šπ‘—π‘œπ‘• 𝑄1, 𝑄2 , π‘›π‘π‘šπ‘“ ↓ π‘‘π‘π‘£π‘‘π‘—π‘œ π‘Œ, 𝑍 ← π‘Œ β‰  𝑍, π‘›π‘π‘šπ‘“ π‘Œ , π‘ž1 𝑍, π‘Œ . π‘›π‘π‘šπ‘“ ↓ π‘‘π‘π‘£π‘‘π‘—π‘œ π‘Œ, 𝑍 ← π‘Œ β‰  𝑍, π‘›π‘π‘šπ‘“ π‘Œ , π‘ž1 𝑍, π‘Œ . π‘Œ β‰  𝑍 π‘›π‘π‘šπ‘“(π‘Œ). Nick Hippen University of Nebraska at Omaha 8

  9. Experimental Analysis β€’ ASPCCG : ASP based natural language parser β€’ 3 encodings of increasing levels of human optimization β€’ Created by Matthew Buddenhagen, Yuliya Lierler & Peter Schuller β€’ Enc1: No human optimization β€’ Enc7: Moderate human optimization β€’ Enc19: Notable human optimization Nick Hippen University of Nebraska at Omaha 9

  10. ASPCCG: Encoding 1 Solve Time Grounding Size Nick Hippen University of Nebraska at Omaha 10

  11. ASPCCG: Encoding 7 Solve Time Grounding Size Nick Hippen University of Nebraska at Omaha 11

  12. ASPCCG: Encoding 19 Solve Time Grounding Size Nick Hippen University of Nebraska at Omaha 12

  13. ASPCCG: Overall Nick Hippen University of Nebraska at Omaha 13

  14. Related, Current & Future Work β€’ Related work: lpopt (Bichler, Morak, Woltran, 2016) β€’ Paper will be submitted to Practical Aspects of Declarative Languages (PADL) 2019 this weekend β€’ System PROJECTOR available on the UNO NLPKR Lab website Future Work β€’ Gather more benchmarks β€’ Grounding size prediction β€’ Improve language support Nick Hippen University of Nebraska at Omaha 14

  15. Acknowledgements β€’ Michael Dingess β€’ Brian Hodges β€’ Daniel Houston β€’ Roland Kaminski β€’ Liu Liu β€’ Dr. Mirek Truszczynski β€’ Stefan Woltran Nick Hippen University of Nebraska at Omaha 15

  16. Ques Questio ions? ns? Nick Hippen University of Nebraska at Omaha 16

Recommend


More recommend