How Easy it is to Know How: An Upper Bound for the Satisfiability Problem

Areces, Carlos; Cassano, Valentin; Castro, Pablo F.; Fervari, Raul; Saravia, Andrés R.

doi:10.1007/978-3-031-43619-2_28

Lecture Notes in Computer Science

2023

DOI: 10.1007/978-3-031-43619-2_28

|View full text |Cite

How Easy it is to Know How: An Upper Bound for the Satisfiability Problem

Carlos Areces,

Valentin Cassano,

Pablo F. Castro

et al.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2023

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Uncertainty-based knowing how logic

Areces,

Fervari,

Saravia

et al. 2023

Journal of Logic and Computation

View full text Add to dashboard Cite

We introduce a novel semantics for a multi-agent epistemic operator of knowing how, based on an indistinguishability relation between plans. Our proposal is, arguably, closer to the standard presentation of knowing that modalities in classical epistemic logic. We study the relationship between this new semantics and previous approaches, showing that our setting is general enough to capture them. We also study the logical properties of the new semantics. First, we define a sound and complete axiomatization. Second, we define a suitable notion of bisimulation and prove correspondence theorems. Finally, we investigate the computational complexity of the model checking and satisfiability problems for the new logic.

show abstract

Uncertainty-based knowing how logic

Areces,

Fervari,

Saravia

et al. 2023

Journal of Logic and Computation

View full text Add to dashboard Cite

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

How Easy it is to Know How: An Upper Bound for the Satisfiability Problem

Cited by 1 publication

References 22 publications

Uncertainty-based knowing how logic

Uncertainty-based knowing how logic

Contact Info

Product

Resources

About