Skip Navigation


Journal of Logic and Computation Advance Access originally published online on September 4, 2007
Journal of Logic and Computation 2008 18(1):13-33; doi:10.1093/logcom/exm051
This Article
Right arrow Full Text
Right arrow Full Text (PDF)
Right arrow All Versions of this Article:
18/1/13    most recent
exm051v1
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Bittencourt, G.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author, 2007. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

Original Articles

Combining Syntax and Semantics through Prime Form Representation

Guilherme Bittencourt

Departamento de Automação e Sistemas, Universidade Federal de Santa Catarina, 88040-900 - Florianópolis - SC - Brazil. E-mail: gb{at}das.ufsc.br

Received 22 January 2007.


  Abstract

This article presents an algorithm that, besides calculating the number of models of a propositional logic theory, also determines the distribution of these models among the terms of a disjunctive normal form representation of the theory. Using prime implicants to represent the target theory, in a knowledge compilation context, we discuss how this distribution can be used to define belief change operators that respect the theory structure. Some experimental results are also presented.

Keywords: Knowledge representation; model counting; prime implicants; knowledge compilation; belief revision


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.