Skip to Main Content Area
  • CPS-VO
    • Contact Support
  • Browse
    • Calendar
    • Announcements
    • Repositories
    • Groups
  • Search
    • Search for Content
    • Search for a Group
    • Search for People
    • Search for a Project
    • Tagcloud
      
 
Not a member?
Click here to register!
Forgot username or password?
 
Home
National Science Foundation

Cyber-Physical Systems Virtual Organization

Read-only archive of site from September 29, 2023.

CPS-VO

satisfiability

biblio

Visible to the public The Authorization Policy Existence Problem

Submitted by grigby1 on Wed, 05/16/2018 - 1:44pm
  • Control Theory
  • Resiliency
  • Access Control
  • computational complexity
  • Computing Theory
  • fixed-parameter tractability
  • pubcrawl
  • resilience
  • satisfiability
file

Visible to the public Zawadzki_Generalization_SAT_AP.pdf

Submitted by Jamie Presken on Mon, 12/05/2016 - 10:02am
  • #SAT
  • CMU
  • counting
  • July'14
  • policy evaluation
  • quantifier alternation
  • satisfiability
biblio

Visible to the public A Generalization of SAT and #SAT for Robust Policy Evaluation

Submitted by Jamie Presken on Mon, 12/05/2016 - 9:51am
  • #SAT
  • CMU
  • counting
  • July'14
  • policy evaluation
  • quantifier alternation
  • satisfiability
  • CMU
  • July'14
file

Visible to the public Efficient and Verified Checking of Unsatisfiability Proofs

Submitted by TimTh on Tue, 05/14/2013 - 1:14pm. Contributors:
  • Marijn Heule
  • Warren A. Hunt, Jr.
  • Nathan Wetzler

Presented as part of the 2013 HCSS conference.

ABSTRACT

  • formal verification
  • satisfiability
  • tools
  • University of Texas
  • Academia
  • Presentation
  • HCSS'13
  • HW/SW (HCSS'13)

Terms of Use  |  ©2023. CPS-VO