logic control an example
play

Logic + Control: An example or SAT solver of Howe & King as a - PowerPoint PPT Presentation

Aug 31, 2023 •388 likes •806 views

Intro. Specification Correctness&. . . Programs Final Logic + Control: An example or SAT solver of Howe & King as a logic program (File ./LIPIcs/29.pdf ) W lodzimierz Drabent Institute of Computer Science, Polish Academy of

  1. Intro. Specification Correctness&. . . Programs Final Logic + Control: An example or SAT solver of Howe & King as a logic program (File ./LIPIcs/29.pdf ) W� lodzimierz Drabent Institute of Computer Science, Polish Academy of Sciences Link¨ oping University (Sweden) http://www.ipipan.waw.pl/~drabent ICLP’12, 6th September 2012 Version compiled on September 10, 2012 1 / 25

  2. Intro. Specification Correctness&. . . Programs Final This file contains extra material, not intended to be shown within a short presentation. In particular, such are all the slides with their titles in parentheses. 2 / 25

  3. Intro. Specification Correctness&. . . Programs Final logic Is there in actual Logic Programming ? “logic” To which extent LP is declarative/logical ? 3 / 25

  4. Intro. Specification Correctness&. . . Programs Final Representation How to reason about logic programs? We present a construction of a practical Prolog program (SAT solver of Howe&King). Most of the reasoning done at the declarative level (formally) abstracting from any operational semantics. Plan ◮ Specification ◮ Logic programs 1, 2, 3 ◮ Proving correctness & ◮ Adding control completeness ◮ Conclusions 4 / 25

  5. Intro. Specification Correctness&. . . Programs Final Representation How to reason about logic programs? We present a construction of a practical Prolog program (SAT solver of Howe&King). Most of the reasoning done at the declarative level (formally) abstracting from any operational semantics. Plan ◮ Specification ◮ Logic programs 1, 2, 3 ◮ Proving correctness & ◮ Adding control completeness ◮ Conclusions 4 / 25

  6. Intro. Specification Correctness&. . . Programs Final Representation How to reason about logic programs? We present a construction of a practical Prolog program (SAT solver of Howe&King). Most of the reasoning done at the declarative level (formally) abstracting from any operational semantics. Plan ◮ Specification ◮ Logic programs 1, 2, 3 ◮ Proving correctness & ◮ Adding control completeness ◮ Conclusions 4 / 25

  7. Intro. Specification Correctness&. . . Programs Final Representation Preliminaries Definite programs. To describe relations to be defined by program predicates: Specification – a Herbrand interpretation S . Specified atom – a p ( t 1 , . . . , t n ) ∈ S . 5 / 25

  8. Intro. Specification Correctness&. . . Programs Final Representation Representation of propositional formulae for a SAT solver [Howe&King] Literals x ¬ x as pairs true-X false-X CNF formulae ( . . . ∧ ( . . . ∨ Literal ij ∨ . . . ) ∧ . . . ) as lists of lists [ . . . , [ . . . , Pair ij , . . . ] , . . . ] CNF formula [ f 1 , . . . , f n ] is satisfiable iff it has an instance [ f 1 θ, . . . , f n θ ] where ∀ i f i θ ∈ L 0 1 = { [ t 1 - u 1 , . . . , u - u, . . . , t n - u n ] ∈ H } . CNF formula f is satisfiable iff some fθ is in L 0 2 = { [ f 1 θ, . . . , f n θ ] | as above } . A program defining L 0 2 is a SAT solver. 6 / 25

  9. Intro. Specification Correctness&. . . Programs Final Towards Approximate specifications (Spec. 1) Specifying a SAT solver So apparently a SAT solver should compute L 0 2 . 7 / 25

  10. Intro. Specification Correctness&. . . Programs Final Towards Approximate specifications (Spec. 1) Specifying a SAT solver So apparently a SAT solver should compute L 0 2 . Computing exact L 0 2 unnecessary. E.g. nobody uses append/3 defining the list appending relation exactly! ❘ Common in LP: relations to be computed known approximately. 7 / 25

  11. Intro. Specification Correctness&. . . Programs Final Towards Approximate specifications (Spec. 1) Specifying a SAT solver So may a SAT solver should compute L 0 2 . Computing exact L 0 2 unnecessary. E.g. nobody uses append/3 defining the list appending relation exactly! ❘ Common in LP: relations to be computed known approximately. 7 / 25

  12. Intro. Specification Correctness&. . . Programs Final Towards Approximate specifications (Spec. 1) Specifying a SAT solver So may a SAT solver should compute L 0 2 . Also it may compute a certain L 2 ⊇ L 0 2 . L 2 = { s ∈ H | if s is a list of lists of pairs then s ∈ L 0 2 } . ❘ Common in LP: relations to be computed known approximately. 7 / 25

  13. Intro. Specification Correctness&. . . Programs Final Towards Approximate specifications (Spec. 1) Specifying a SAT solver So may a SAT solver should compute L 0 2 . Also it may compute a certain L 2 ⊇ L 0 2 . L 2 = { s ∈ H | if s is a list of lists of pairs then s ∈ L 0 2 } . Any set L 0 2 ⊆ L ′ 2 ⊆ L 2 will do: a CNF formula f is satisfiable iff some fθ is in L ′ 2 . ❘ Common in LP: relations to be computed known approximately. 7 / 25

  14. Intro. Specification Correctness&. . . Programs Final Towards Approximate specifications (Spec. 1) Approximate specifications S 0 � �� � required incorrect � �� � S , where S 0 ⊆ S . Approximate specification – ( S 0 , S ) ↑ ↑ for completeness for correctness S 0 ⊆ M P ⊆ S . S 0 – what has to be computed. Intention: S – what may be computed. 8 / 25

  15. Intro. Specification Correctness&. . . Programs Final Towards Approximate specifications (Spec. 1) Approximate specifications S 0 � �� � required incorrect � �� � S Approximate specification for SAT solver: ( S 0 1 , S 1 ) , 2 : L 0 states that predicate sat cnf defines a set L ′ 2 ⊆ L ′ 2 ⊆ L 2 . [Details � the paper] 8 / 25

  16. Intro. Specification Correctness&. . . Programs Final Towards Approximate specifications (Spec. 1) (Details – 1st specification for SAT solver) ( S 0 Specification: 1 , S 1 ) with the specified atoms S 0 1 : S 1 : where t ∈ L 0 sat cnf ( t ) , where t ∈ L 2 , sat cnf ( t ) , 2 , sat cl ( s ) , s ∈ L 0 1 , sat cl ( s ) , s ∈ L 1 , x = x, x = x, x ∈ H x ∈ H L 0 1 = { [ t 1 - u 1 , . . . , u - u, . . . , t n - u n ] ∈ H } , L 0 2 = { [ s 1 , . . . , s n ] | s 1 , . . . , s n ∈ L 0 1 } , L 1 = { t ∈ H | if t is a list of pairs then t ∈ L 0 1 } , L 2 = { s ∈ H | if s is a list of lists of pairs then s ∈ L 0 2 } . 9 / 25

  17. Intro. Specification Correctness&. . . Programs Final Correctness & completeness of programs Correctness (imperative programming) ւ ց Correctness Completeness (logic programming) M P ⊆ S S ⊆ M P Completeness: Everything required by the spec. is computed. Correctness: Everything computed is compatible with the spec. P semi-complete w.r.t. S = P complete for terminating queries (under some selection rule). [Details � the paper] 10 / 25

  18. Intro. Specification Correctness&. . . Programs Final Correctness & completeness of programs Correctness (imperative programming) ւ ց Correctness Completeness (logic programming) M P ⊆ S S ⊆ M P Completeness: Everything required by the spec. is computed. Correctness: Everything computed is compatible with the spec. P semi-complete w.r.t. S = P complete for terminating queries (under some selection rule). [Details � the paper] 10 / 25

  19. Intro. Specification Correctness&. . . Programs Final Correctness & completeness, sufficient conditions Th . (Clark 1979): P correct w.r.t. S when for each ( H ← B ) ∈ ground ( P ) , B ⊆ S ⇒ H ∈ S . (Out of correct atoms, the clauses produce only correct atoms.) Th .: P semi-complete w.r.t. S when for each H ∈ S , exists ( H ← B ) ∈ ground ( P ) where B ⊆ S . (Each required atom can be produced out of required atoms.) Semi-complete + terminating ⇒ complete. 11 / 25

  20. Intro. Specification Correctness&. . . Programs Final Correctness & completeness, sufficient conditions Th . (Clark 1979): P correct w.r.t. S when for each ( H ← B ) ∈ ground ( P ) , B ⊆ S ⇒ H ∈ S . (Out of correct atoms, the clauses produce only correct atoms.) Th .: P semi-complete w.r.t. S when for each H ∈ S , exists ( H ← B ) ∈ ground ( P ) where B ⊆ S . (Each required atom can be produced out of required atoms.) Semi-complete + terminating ⇒ complete. 11 / 25

  21. Intro. Specification Correctness&. . . Programs Final Program 1 (2 (2a) 3) 23 Control (Control details) SAT solver 1 P 1 : sat cnf ([ ]) . sat cnf ([ Clause | Clauses ]) ← sat cl ( Clause ) , sat cnf ( Clauses ) . sat cl ([ Pol - V ar | Pairs ]) ← Pol = V ar. sat cl ([ H | Pairs ]) ← sat cl ( Pairs ) . Can be constructed guided by the sufficient conditions above, and specification ( S 0 1 , S 1 ) . Correct w.r.t. S 1 , complete w.r.t. S 0 1 . [Details � the paper] Inefficient backtracking search. 12 / 25

  22. Intro. Specification Correctness&. . . Programs Final Program 1 (2 (2a) 3) 23 Control (Control details) SAT solver 1 P 1 : sat cnf ([ ]) . sat cnf ([ Clause | Clauses ]) ← sat cl ( Clause ) , sat cnf ( Clauses ) . sat cl ([ Pol - V ar | Pairs ]) ← Pol = V ar. sat cl ([ H | Pairs ]) ← sat cl ( Pairs ) . Can be constructed guided by the sufficient conditions above, and specification ( S 0 1 , S 1 ) . Correct w.r.t. S 1 , complete w.r.t. S 0 1 . [Details � the paper] Inefficient backtracking search. 12 / 25

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Sequential Logic Design Process Control Flaxer Eli - Process Control Ch 2 - 1 Logic Devices

Sequential Logic Design Process Control Flaxer Eli - Process Control Ch 2 - 1 Logic Devices

Chapter 2 Sequential Logic Design Process Control Flaxer Eli - Process Control Ch 2 - 1 Logic Devices Logic devices divide into two major types: Combinational Logic Current output depends on current input only Gates, decoders,

453 views • 7 slides
PROGRAMMABLE LOGIC CONTROLLER Control Systems Types Programmable Logic Controllers

PROGRAMMABLE LOGIC CONTROLLER Control Systems Types Programmable Logic Controllers

PROGRAMMABLE LOGIC CONTROLLER Control Systems Types Programmable Logic Controllers Distributed Control System PC- Based Controls Programmable Logic Controllers PLC Sequential logic solver PID Calculations. Advanced

292 views • 27 slides
A Compositional Logic A Compositional Logic for Control Flow for Control Flow Gang Tan, Boston

A Compositional Logic A Compositional Logic for Control Flow for Control Flow Gang Tan, Boston

A Compositional Logic A Compositional Logic for Control Flow for Control Flow Gang Tan, Boston College g , g Andrew W. Appel, Princeton University Jan 8 2006 Jan 8, 2006 1 Mobile Code Security Protect trusted system against

561 views • 26 slides
Chapter 1 Combinational Logic Process Control Ch 1- 1 Flaxer Eli - Process Control Chapter

Chapter 1 Combinational Logic Process Control Ch 1- 1 Flaxer Eli - Process Control Chapter

Chapter 1 Combinational Logic Process Control Ch 1- 1 Flaxer Eli - Process Control Chapter Outline Documentation Standards for digital systems. Combinational Logic Design Structures : - Logic Gates - Decoders - Encoders -

583 views • 9 slides
8/28/2010 CONTROL UNIT CPU is partitioned into Arithmetic Logic Unit (ALU) and Control Unit

8/28/2010 CONTROL UNIT CPU is partitioned into Arithmetic Logic Unit (ALU) and Control Unit

8/28/2010 CONTROL UNIT CPU is partitioned into Arithmetic Logic Unit (ALU) and Control Unit (CU) . The function of control unit is to generate relevant timing and control signals to all operations in the MANINDER KAUR computer.

295 views • 4 slides
Overshadow PLC to Detect ct Remote Co Control-Logic c Inject ction Attack cks Irfan Ahmed

Overshadow PLC to Detect ct Remote Co Control-Logic c Inject ction Attack cks Irfan Ahmed

Overshadow PLC to Detect ct Remote Co Control-Logic c Inject ction Attack cks Irfan Ahmed Department of Computer Science Virginia Commonwealth University In Industrial ial Control l System ems Control Center Corporate Network

484 views • 22 slides
Programmable Logic Control Technology When is plc TECH required ? When there is more than 200

Programmable Logic Control Technology When is plc TECH required ? When there is more than 200

Programmable Logic Control Technology When is plc TECH required ? When there is more than 200 addresses this is the most cost effective way to control lighting What other technologies are compatible with plc TECH ? A PLC can be integrated with

155 views • 12 slides
Why Again Logic Synthesis Giovanni De Micheli Why again logic synthesis? Strong

Why Again Logic Synthesis Giovanni De Micheli Why again logic synthesis? Strong

Why Again Logic Synthesis Giovanni De Micheli Why again logic synthesis? Strong intellectual value associated with logic synthesis and optimization Problems are far from being solved Current methods and tools grew out of control

372 views • 24 slides
Learning Outcomes I understand the control inputs to counters I can design logic to control

Learning Outcomes I understand the control inputs to counters I can design logic to control

2-2.1 2-2.2 Learning Outcomes I understand the control inputs to counters I can design logic to control the inputs of Spiral 2-2 counters to create a desired count sequence I understand how smaller adder blocks can be combined to

401 views • 16 slides
UMBC A B M A L T F O U M B C I M Y O R T 1 (11/30/05) I E S R C E O V

UMBC A B M A L T F O U M B C I M Y O R T 1 (11/30/05) I E S R C E O V

Programmable Logic Devices Verilog VIII CMPE 415 Synthesis of Sequential Logic A Verilog description of sequential logic can be synthesized only if certain conditions are met. In general, the event control expression of a cyclic behavior must

509 views • 22 slides
Control Structures in C Overview 1)Logic & Logical Operators 2)Selection Mechanisms if

Control Structures in C Overview 1)Logic & Logical Operators 2)Selection Mechanisms if

Control Structures in C Overview 1)Logic & Logical Operators 2)Selection Mechanisms if elseif else switch 3)Loop Mechanisms 1 Logic and Selection In English (Natural Language) we can make statements such as: If it snows I stay

688 views • 37 slides
Computational Logic The (ISO-)Prolog Programming Language 1 (ISO-)Prolog A practical logic

Computational Logic The (ISO-)Prolog Programming Language 1 (ISO-)Prolog A practical logic

Computational Logic The (ISO-)Prolog Programming Language 1 (ISO-)Prolog A practical logic language based on the logic programming paradigm. Main differences with pure logic programming: more control on the execution flow,

625 views • 45 slides
Computational Logic The Prolog Programming Language 1 Prolog A practical logic language

Computational Logic The Prolog Programming Language 1 Prolog A practical logic language

Computational Logic The Prolog Programming Language 1 Prolog A practical logic language based on the logic programming paradigm. Main differences with pure logic programming: more control on the execution flow, depth-first

814 views • 39 slides
Classical logic, control calculi and data types Robbert Krebbers November 2, 2010 @ The Brouwer

Classical logic, control calculi and data types Robbert Krebbers November 2, 2010 @ The Brouwer

Classical logic, control calculi and data types Robbert Krebbers November 2, 2010 @ The Brouwer seminar The Curry-Howard correspondence Computation Logic Types Formulas Programs Proofs Reduction Proof

572 views • 33 slides
Logic in Access Control Mart n Abadi Microsoft Research, Silicon Valley and University of

Logic in Access Control Mart n Abadi Microsoft Research, Silicon Valley and University of

Logic in Access Control Mart n Abadi Microsoft Research, Silicon Valley and University of California, Santa Cruz Contents Introduction to access control. Some logical approaches. Some systems and languages. A closer look at a

1.36k views • 114 slides
Experiment Control Upgrades at DESY Teresa Nez DESY Photon Science PiLC Logic

Experiment Control Upgrades at DESY Teresa Nez DESY Photon Science PiLC Logic

Experiment Control Upgrades at DESY Teresa Nez DESY Photon Science PiLC Logic Controller ADQ412 Digitizer Diffractometer in Sardana GPFS storage system Tango Meeting ONERA, 21-06-16 PiLC Logic Controller

761 views • 13 slides
Fuzzing remote interfaces for system services in Android Alexandru Blanda Information Security

Fuzzing remote interfaces for system services in Android Alexandru Blanda Information Security

Fuzzing remote interfaces for system services in Android Alexandru Blanda Information Security Engineer 1 Agenda Context Fuzzing tool implementation Results and vulnerabilities 2 Context Intro to System Services System services

446 views • 31 slides
(R) Evolution Philipp Krenn @xeraa Revolution

(R) Evolution Philipp Krenn @xeraa Revolution

(R) Evolution Philipp Krenn @xeraa Revolution https://db-engines.com/en/ranking https://www.reddit.com/r/SQL/comments/7i828i/ms_sql_query_is_too_complex/ Who uses Elasticsearch? Infrastructure | Developer Advocate

919 views • 59 slides
A Few Open Problems in Vertically-Partially-Connected 3D-NoC Frdric Ptrot and Hamed

A Few Open Problems in Vertically-Partially-Connected 3D-NoC Frdric Ptrot and Hamed

A Few Open Problems in Vertically-Partially-Connected 3D-NoC Frdric Ptrot and Hamed Sheibanyrad System-Level Synthesis Group TIMA Laboratory 46, Av Flix Viallet, 38031 Grenoble, France July 17 th , 2015 July 17th, 2015 Frdric

799 views • 10 slides
Jurong West Primary School English Department Primary 1 TEAMWORK Key changes To enhance

Jurong West Primary School English Department Primary 1 TEAMWORK Key changes To enhance

Jurong West Primary School English Department Primary 1 TEAMWORK Key changes To enhance the joy of learning starting 2019 1) No weighted assessment from 2019 (including year-end exam for P2) 2) Use qualitative descriptors to report

734 views • 28 slides
Ge#ngSmarterAbout theSmartGrid TimothySchoechle,PhD

Ge#ngSmarterAbout theSmartGrid TimothySchoechle,PhD

Ge#ngSmarterAbout theSmartGrid TimothySchoechle,PhD SeniorResearchFellow NaGonalInsGtuteforScience,Law,andPublicPolicy Washington,DC CommonwealthClubofCalifornia

190 views • 17 slides
Lower Bound Techniques for QBF Proof Systems Meena Mahajan The Institute of Mathematical

Lower Bound Techniques for QBF Proof Systems Meena Mahajan The Institute of Mathematical

Lower Bound Techniques for QBF Proof Systems Meena Mahajan The Institute of Mathematical Sciences, HBNI, Chennai. Complexity, Algorithms, Automata, Logic Meeting CAALM 2019, CMI, India. 21-25 Jan 2019 24 Jan 2019 Meena Mahajan, IMSc Credits

980 views • 94 slides
26th International Cartographic Conference, Dresden, Germany, 25 30 August 2013 Exploring the

26th International Cartographic Conference, Dresden, Germany, 25 30 August 2013 Exploring the

26th International Cartographic Conference, Dresden, Germany, 25 30 August 2013 Exploring the Impact of a Spatial Data Infrastructure on Value Added Resellers and Vice Versa Antony K. Cooper, Serena Coetzee, Petr Rapant, Dominique Laurent,

521 views • 15 slides
9:'8(41+; 34.'()#%5+01#/4&$1'6+7%(41814('()#% "#$%&'()#%*+#,+-#.)/+01#.1'22)%.

9:'8(41+; 34.'()#%5+01#/4&$1'6+7%(41814('()#% "#$%&'()#%*+#,+-#.)/+01#.1'22)%.

9:'8(41+; 34.'()#%5+01#/4&$1'6+7%(41814('()#% "#$%&'()#%*+#,+-#.)/+01#.1'22)%. 34.'()#%5+01#/4&$1'6+7%(41814('()#% ! =$(6)%4 >#()?'(4+%4.'()#%+@)(:+(@#+4A'2864* BA(4%&4&+81#.1'2*+'%&+C$41)4*

490 views • 33 slides

More recommend