Sciweavers

746 search results - page 132 / 150
» Connectionist Propositional Logic
Sort
View
125
Voted
ICAIL
2007
ACM
15 years 7 months ago
The Ontology of Legal Possibilities and Legal Potentialities
Ontologies in a legal expert system must be processed to suit all possible user cases within the field of law of the system. From the logical premises of a deductive system of expr...
Pamela N. Gray
CIE
2007
Springer
15 years 10 months ago
Computational Complexity of Constraint Satisfaction
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
Heribert Vollmer
161
Voted
LOGCOM
2007
125views more  LOGCOM 2007»
15 years 3 months ago
Epistemic Actions as Resources
We provide algebraic semantics together with a sound and complete sequent calculus for information update due to epistemic actions. This semantics is flexible enough to accommoda...
Alexandru Baltag, Bob Coecke, Mehrnoosh Sadrzadeh
CADE
2006
Springer
16 years 4 months ago
Canonical Gentzen-Type Calculi with (n, k)-ary Quantifiers
Propositional canonical Gentzen-type systems, introduced in [1], are systems which in addition to the standard axioms and structural rules have only logical rules in which exactly ...
Anna Zamansky, Arnon Avron
133
Voted
ICSE
2007
IEEE-ACM
16 years 3 months ago
Sequential Circuits for Relational Analysis
The Alloy tool-set has been gaining popularity as an alternative to traditional manual testing and checking for design correctness. Alloy uses a first-order relational logic for m...
Fadi A. Zaraket, Adnan Aziz, Sarfraz Khurshid