Modal satisifiability in a constraint logic environment

Modal satisifiability in a constraint logic environment

Show other versions (1)

The modal satisfiability problem has to date been solved using either a specifically designed algorithm, or by translating the modal logic formula into a different class of problem, such as a first-order logic, a propositional satisfiability problem or a constraint satisfaction problem. These app...

Full description

Bibliographic Details
Main Author: Stevenson, Lynette
Other Authors: Britz, K. (Prof.)
Format: Others
Language:en
Published: 2009
Subjects:
Modal satisfiability
Modal validity
Constraint satisfaction problem
Constraint solver
Tableau system
First-order translation
ECLiPSe
Modal logics K,KT,S4
Constraint logic programming
005.116
Computer algorithms
Business > Data processing
Modality (Logic)
Constraint programming (Computer science)
Constraints (Artificial intelligence)
Programming (Computers)
Logic programming
Online Access:Stevenson, Lynette (2009) Modal satisifiability in a constraint logic environment, University of South Africa, Pretoria, <http://hdl.handle.net/10500/2030>
http://hdl.handle.net/10500/2030

Internet

Stevenson, Lynette (2009) Modal satisifiability in a constraint logic environment, University of South Africa, Pretoria, <http://hdl.handle.net/10500/2030>
http://hdl.handle.net/10500/2030

Similar Items