Sciweavers

746 search results - page 132 / 150
» Connectionist Propositional Logic
Sort
View
ICAIL
2007
ACM
15 years 1 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 4 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
LOGCOM
2007
125views more  LOGCOM 2007»
14 years 9 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
15 years 10 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
ICSE
2007
IEEE-ACM
15 years 10 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