Sciweavers

325 search results - page 40 / 65
» Representation Theory for Default Logic
Sort
View
IJCAI
2007
14 years 11 months ago
Recursive Random Fields
A formula in first-order logic can be viewed as a tree, with a logical connective at each node, and a knowledge base can be viewed as a tree whose root is a conjunction. Markov l...
Daniel Lowd, Pedro Domingos
ACL
1992
14 years 10 months ago
Information States as First Class Citizens
The information state of an agent is changed when a text (in natural language) is processed. The meaning of a text can be taken to be this information state change potential. The ...
Jørgen Villadsen
WOLLIC
2009
Springer
15 years 4 months ago
Classic-Like Analytic Tableaux for Finite-Valued Logics
The paper provides a recipe for adequately representing a very inclusive class of finite-valued logics by way of tableaux. The only requisite for applying the method is that the o...
Carlos Caleiro, João Marcos
AAAI
2006
14 years 11 months ago
Local-Search Techniques for Boolean Combinations of Pseudo-Boolean Constraints
Some search problems are most directly specified by boolean combinations of pseudo-boolean constraints. We study a logic PL(PB) whose formulas are of this form, and design local-s...
Lengning Liu, Miroslaw Truszczynski
ICAIL
2005
ACM
15 years 3 months ago
Computational Law
Computational law is an approach to automated legal reasoning focusing on semantically rich laws, regulations, contract terms, and business rules in the context of electronicallym...
Nathaniel Love, Michael R. Genesereth