BIRTHDAY 2005 - PDF Preprint Papers

BIRTHDAY 2005 Computation Theory and Logic

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed BIRTHDAY-2005 Paper

click to vote

BIRTHDAY
2005
Springer

233views Applied Computing» more BIRTHDAY 2005»

Logical Non-determinism as a Tool for Logical Modularity: An Introduction

14 years 6 months ago

Download www.cs.tau.ac.il

Arnon Avron

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	233	Logical Non-determinism as a Tool for Logical Modularity: An Introduction	claim
2	175	Planning in Answer Set Programming using Ordered Task Decomposition	claim
3	158	Fibring Logics: Past, Present and Future	claim
4	152	Description Logics as Ontology Languages for the Semantic Web	claim
5	149	An Essay on Sabotage and Obstruction	claim
6	147	Bridging Theorem Proving and Mathematical Knowledge Retrieval	claim
7	143	Ambient Intelligence: Towards Smart Appliance Ensembles	claim
8	139	Synthesis Revisited: Generating Statechart Models from Scenario-Based Requirements	claim
9	137	A Characterisation of Weak Bisimulation Congruence	claim
10	136	Agents with Exact Foreknowledge	claim
11	134	Objective Bayesian Nets	claim
12	132	Toward Automated Large-Scale Information Integration and Discovery	claim
13	129	Towards MultiMedia Instruction in Safe and Secure Systems	claim
14	126	Formal Software Development in MAYA	claim
15	124	Time for Thinking Big in AI	claim
16	123	Compositional Reasoning for Probabilistic Finite-State Behaviors	claim
17	122	History and Future of Implicit and Inductionless Induction: Beware the Old Jade and the Zombie!	claim
18	116	Timing the Untimed: Terminating Successfully While Being Conservative	claim
19	116	Expander2	claim
20	115	Compiled Labelled Deductive Systems for Access Control	claim
21	115	Modal Logics for Metric Spaces: Open Problems	claim
22	113	Main Concepts of Networks of Transformation Units with Interlinking Semantics	claim
23	112	Nonmonotonic Reasoning	claim
24	112	Observing Reductions in Nominal Calculi Via a Graphical Encoding of Processes	claim
25	112	A Mobility Calculus with Local and Dependent Types	claim
26	111	Visualization in Digital Libraries	claim
27	110	Flexible Interconnection of Graph Transformation Modules	claim
28	107	Towards Comprehensive Computational Models for Plan-Based Control of Autonomous Robots	claim
29	107	Natural Language Proof Explanation	claim
30	106	Open Problems in Logic and Games	claim
31	106	Loose Semantics of Petri Nets	claim
32	105	Finite Equational Bases in Process Algebra: Results and Open Questions	claim
33	105	Detecting the Logical Content: Burley's 'Purity of Logic'	claim
34	105	Modelling Periodic Temporal Notions by Labelled Partitionings - The PartLib Library	claim
35	105	Overview on Decentralized Establishment of Multi-lateral Collaborations	claim
36	104	Classical Natural Deduction	claim
37	104	Graph Transformation with Variables	claim
38	103	Goal-Directed Methods for Fuzzy Logics	claim
39	102	Term Rewriting Meets Aspect-Oriented Programming	claim
40	101	Information Dissemination in Modern Banking Applications	claim
41	101	Reduction Strategies for Left-Linear Term Rewriting Systems	claim
42	101	Modelling Evolvable Systems: A Temporal Logic View	claim
43	100	Still	claim
44	100	Reducing Right-Hand Sides for Termination	claim
45	98	Model Theory for Process Algebra	claim
46	98	Splitting Logics	claim
47	98	Changing Labels in the Double-Pushout Approach Can Be Treated Categorically	claim
48	97	SAT-Based Decision Procedures for Automated Reasoning: A Unifying Perspective	claim
49	97	Separation - Past, Present, and Future	claim
50	97	A Hierarchical Analysis of Propositional Temporal Logic based on Intervals	claim
51	96	Sharing in the Weak Lambda-Calculus	claim
52	96	a-logic	claim
53	93	TV Scout: Lowering the Entry Barrier to Personalized TV Program Recommendation	claim
54	93	Primitive Rewriting	claim
55	93	Axiomatic Rewriting Theory I: A Diagrammatic Standardization Theorem	claim
56	92	A Cook's Tour of the Finitary Non-Well-Founded Sets	claim
57	92	Psychological Validity of Schematic Proofs	claim
58	92	A Knowledge Integration Framework for Information Visualization	claim
59	92	Dimensions of Neural-symbolic Integration - A Structured Survey	claim
60	90	Reichenbach, Prior and Montague: A Semantic Get-together	claim
61	90	Mathematical Foundations of Answer Set Programming	claim
62	90	From Graph Transformation to Software Engineering and Back	claim
63	89	Formal Approaches to Teamwork	claim
64	87	A Modal View on Polder Politics	claim
65	87	SAT-Based Cooperative Planning: A Proposal	claim
66	87	Interpolation and Joint Consistency	claim
67	83	Specifying, Programming and Verifying with Equational Logic	claim
68	83	On Neighbourhood Semantics 30 years later	claim
69	81	On the Proof Theory of the Existence Predicate	claim
70	80	Simulating Algebraic High-Level Nets by Parallel Attributed Graph Transformation	claim
71	79	Graph Transformation in Molecular Biology	claim
72	77	Caching over the Entire User-to-Data Path in the Internet	claim
73	73	Temporal Dynamics of Support and Attack Networks: From Argumentation to Zoology	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers