loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Authors: Thomas C. Henderson 1 ; David Sacharny 2 ; Amar Mitiche 3 ; Xiuyi Fan 4 ; Amelia Lessen 1 ; Ishaan Rajan 1 and Tessa Nishida 1

Affiliations: 1 School of Computing, University of Utah, Salt Lake City, Utah, U.S.A. ; 2 Blyncsy Inc, Salt Lake City, UT, U.S.A. ; 3 Department of Telecommunications, Institut National de la Recherche Scientifique, Montreal, Quebec, Canada ; 4 Nanyang Technological University, Singapore

Keyword(s): Autonomous Agent Reasoning, Cutting Planes, SAT, PSAT.

Abstract: An early approach to solve the SAT problem was to convert the disjunctions directly to equations which create an integer programming problem with 0-1 solutions. We have independently developed a similar method which we call Chop-SAT based on geometric considerations. Our position is that Chop-SAT provides a wide range of geometric approaches to find SAT and probabilistic SAT (PSAT) solutions. E.g., one potentially powerful approach to determine that a SAT solution exists is to fit the maximal volume ellipsoid and explore it semi-major axis direction to find an Hn vertex in that direction.

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.145.50.71

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
C. Henderson, T.; Sacharny, D.; Mitiche, A.; Fan, X.; Lessen, A.; Rajan, I. and Nishida, T. (2023). Chop-SAT: A New Approach to Solving SAT and Probabilistic SAT for Agent Knowledge Bases. In Proceedings of the 15th International Conference on Agents and Artificial Intelligence - Volume 3: ICAART; ISBN 978-989-758-623-1; ISSN 2184-433X, SciTePress, pages 48-54. DOI: 10.5220/0011614400003393

@conference{icaart23,
author={Thomas {C. Henderson}. and David Sacharny. and Amar Mitiche. and Xiuyi Fan. and Amelia Lessen. and Ishaan Rajan. and Tessa Nishida.},
title={Chop-SAT: A New Approach to Solving SAT and Probabilistic SAT for Agent Knowledge Bases},
booktitle={Proceedings of the 15th International Conference on Agents and Artificial Intelligence - Volume 3: ICAART},
year={2023},
pages={48-54},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0011614400003393},
isbn={978-989-758-623-1},
issn={2184-433X},
}

TY - CONF

JO - Proceedings of the 15th International Conference on Agents and Artificial Intelligence - Volume 3: ICAART
TI - Chop-SAT: A New Approach to Solving SAT and Probabilistic SAT for Agent Knowledge Bases
SN - 978-989-758-623-1
IS - 2184-433X
AU - C. Henderson, T.
AU - Sacharny, D.
AU - Mitiche, A.
AU - Fan, X.
AU - Lessen, A.
AU - Rajan, I.
AU - Nishida, T.
PY - 2023
SP - 48
EP - 54
DO - 10.5220/0011614400003393
PB - SciTePress

- Science and Technology Publications, Lda.
RESOURCES

Proceedings

Papers

Authors

Ontology

CONTACTS

Science and Technology Publications, Lda
Avenida de S. Francisco Xavier, Lote 7 Cv. C,
2900-616 Setúbal, Portugal.

Phone: +351 265 520 185 (National fixed network call)
Fax: +351 265 520 186
Email: info@scitepress.org

EXTERNAL LINKS

PRIMORIS

INSTICC

SCITEVENTS

CROSSREF

PROCEEDINGS SUBMITTED FOR INDEXATION BY:

dblp

Ei Compendex

SCOPUS

Semantic Scholar

Google Scholar

Microsoft Academic